Search Results

Let $f$ denote the function described in the question. The assertion that every trajectory of $f$ except for the one starting at 0 ends in the cycle -1, 1, -1 is equivalent to the Collatz conjecture s …

There are indeed other such polygons. -- For example there is one for $n = 11$, as follows (the origin is in the lower left corner): Also there is one for $n = 15$: Further there are $21$ such p …

Let $n$ be a positive integer, and let $n = \ell_1 + \dots + \ell_k$ be a partition of $n$. Then there exists a convex polygon with side lengths $\ell_1, \dots, \ell_k$ if and only if all of the $\ell …

If you are also interested in problems of that type where $n = \infty$: Given a mapping $f: \mathbb{N} \rightarrow \mathbb{N}$ from the natural numbers to themselves, it is often a notoriously hard pr …

The question has meanwhile been answered in the positive in: Joachim König, A note on the product of two permutations of prescribed orders. European Journal of Combinatorics 57 (2016), 50-56. The proo …

Me funksionin GAP MaxOnes := n -> Maximum(List(Filtered(AsList(GF(2)^[n,n]), M->not ForAny(Tuples([1..n-1],2), s->ForAny(Cartes …

For the sake of simplicity, consider only the case $d=2$. In this case, two pairs $(a,b), (a,c) \in {\rm S}_n^2$ lie in the same orbit if and only if there is a permutation $\pi$ in the centralizer of …

Bounds on Rado numbers for your equation can be found in: Brian Hopkins, Daniel Schaal: On Rado numbers for $\sum_{i=1}^{m-1} a_i x_i = x_m$, Adv. in Appl. Math. 35(2005), no. 4, 433-441.

A very simple way to obtain such partition of the primes is to put the $n$-th prime into the $k$-th set in the partition, where $k$ is the number of 1's in the binary representation of $n$.

For small enough $n$, an efficient way to perform this enumeration is described in the solution to a GAP exercise I posed a few years ago. It basically amounts to setting up a suitable matrix, raising …

Yes, there is a common name for such graphs -- they are called graphs with polynomial growth. See e.g. W. Imrich, N. Seifter: A survey on graphs with polynomial growth, Discr. Math. 95 (1991), 101-11 …

Is there a set $P \subset \mathbb{R}^2$ of points in the Euclidean plane whose intersection with every convex subset of $\mathbb{R}^2$ of area $1$ is nonempty but finite? If the answer is yes, can $P …

Let $G \leq {\rm S}_n$ be a finite permutation group, and let $S = \{g_1, \dots, g_k\}$ be a generating set for $G$ which is closed under inversion and which does not contain the identity. The growth …

On page 218 of John D. Dixon, Brian Mortimer: Permutation Groups, Springer GTM 163, 1996 it is stated: It is a consequence of the classification of finite simple groups that a finite permutat …

How to explain the patterns in the matrix defined in François Brunault's answer to the question Freeness of a Z[x] module depicted below? -- Choosing colors according to the highest power of 2 which …