user340082710

Boolean functions are functions that map from {0,1}^k to {0, 1}. This is a well known term, and they have been studied extensively. Is there well known name for functions that map from {0,1}^k to {0,1}^k ?

i don't have access to that textbook

(the result I mean)

Most textbooks that I've looked at don't cite this information, as it is pretty much common knowledge.

Who first proved that max independent set is NP-hard?

and this is the post in question: cs.stackexchange.com/questions/56636/…

@vzn the original bounty is 100

Is it worth providing a second bounty on a question if it hasn't been answered with the first one?

@vzn I believe it is exactly my problem

:)

@vzn Think I found what I'm looking for: sciencedirect.com/science/article/pii/S0020019008002238

well gray codes originated from the conversion of analog and digital signals

i am looking at the problem from the perspective "how many of the bits do i need to read to perform increment operations"

interesting

It's a nice pun

:D

Canada

@vzn my thesis is based on the results of this paper: sciencedirect.com/science/article/pii/S1570866713001020 if you're interested

I am still looking at the reference, and seeing if there are other results that might be closer to what i've described

Done

this appears quite similar: sciencedirect.com/science/article/pii/S0304397514001078

so i need to see if that formulation has been studied already

in my formulation, however, one specifies the starting and ending points of each path, as well as the number of such paths

looks like a good starting point

i am finishing it this term

i have added that clarification to my question - also, is graph decomposition the name for the problem i am trying to describe?

yes

I am pretty familiar with the gray code literature, but not nearly as much with the literature regarding 'graph decompositions' (though i am not sure that's the correct term)

because i suspect that there is a more general result that is applicable

starting my phd in may

grad

Researcher - I suspect (hope) that a solution to this problem will give me some insight into the generation of certain Gray code - and yes, labeling the vertices by their corresponding binary strings gives the interpretation you mention.

What do you mean by transition-point-like behavior?

I suspect there is some restrictions of the hamming distance of the pairs (s_i, t_i), but haven't found such a result/reference yet.

Do you think that the question lacks information or detail? Or perhaps a better title might attract more viewers?

@EvilJS Well, the hypercube graph is indeed bipartite, but I am asking about the n-cube graph in particular.

What are some good practices to receive more views/attention towards a question you've posted. I feel like there are some questions that receive 100+ views in the matter of a few hours, but mine received 7 views in 12. Is my question perhaps better suited for another stackexchange site perhaps (was thinking maybe math)?

Suppose that I have a binary operator $\oplus$. Normally, one uses the notation $x \oplus y$ to denote the result of apply $\oplus$ to $x$ and $y$. Suppose that I had a set of elements $S$ and a fixed element $y$, is there standard notation to denote the set $\{ x \oplus y : x \in S\}$ (i.e the set obtained by applying the operator to each element in $S$ with $y$)?

so I guess this would be a cyclic-permutation that is also a derrangement?

It isn't quite a cyclic-permutation, since I want to exclude self-loops in my permutation

Is there a name for a permutation that consists of exactly one cycle?

Is there a way to request that a question be moved to a different stackexchange site?

Is there a way to have a question moved to a different stack exchange?