Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
∃ g:N→N ∀ k∈N ∀ D (δ^+(D)≥ g(k) Longrightarrow ∃ C_1,…,C_k vertex-disjoint directed cycles in D such that |C_i|≠|C_j| for all i≠ j), where δ^+(D) denotes the minimum out-degree of D.
Conjecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 900 Patience Ablett Gotzmann’s persistence theorem for smooth projective toric varieties . . . 903 Karim Adiprasito Oda’s strong factorization…
Consider the group of elementary transformations of chord diagrams that preserve their intersection graph. A share is a subdiagram used as a unit in the chord-diagram decompositions considered in the source. Elementary-transformation…
Let G be a bridgeless graph. An oriented 5-cycle double cover is a collection of five directed cycles such that every edge of G belongs to exactly two cycles and the two cycles traverse that edge in opposite directions. Archdeacon–Jaeger's…
Adapt Schoof's method to compute zeta functions of curves without unfavorable dependence on the genus.
Let G=(V,E) be a finite simple digraph with no directed cycle of length at most three; call such a digraph 3-free. Let β(G) be the minimum cardinality of a set X⊆ E(G) such that G∖ X is acyclic, and let gamma(G) be the number of unordered…
There exist two positive absolute constants c_1 and c_2 with the following property. Let λ_1,…,λ_m be logarithms of algebraic numbers with α_i=e^λ_i \ (1≤ i≤ m), let β_0,…, β_m be algebraic numbers, D the degree of the number field…
Indeed, the celebrated conjecture of Ryser, Brualdi and Stein [10, 5, 11] states that every Latin square contains a transversal which uses all but at most one symbol. The Ryser-Brualdi-Stein conjecture is just one thread of the research on…
Let G be a connected graph with at least three vertices. Let Dist'(G) denote the distinguishing index of G, namely the least number of colors in a distinguishing edge coloring, and let Dist'(μ(G)) denote the distinguishing index of its…
Let v_1,v_2,v_3,v_4 be positive integers, and let ML(v_1,v_2,v_3,v_4)=max_t∈Rmin_1≤ i≤ 4lVert tv_irVert, where lVert xrVert denotes the absolute distance from x to the nearest integer. The restricted amended Loneliness Spectrum Conjecture.…
Let t be the number of allowed moves, and let d_1,…,d_t be the corresponding positive integers, with characteristic polynomial χ_S(x)=tx^d_t+∑_i=1^t-1x^d_i+1. Simplicity conjecture. The roots of χ_S(x) are all simple whenever d_t≡ 1pmod2…
Find more MNT curves, including usable larger embedding degrees, more curve families, and smaller cofactors.
Say that a convex body K has property B if for any set of vectors of length no more than c (some small constant), there exists a signing of them s.t. this signed sum lies inside K. What is the convex body with the smallest gaussian volume…
Determine whether Weil descent compromises the security of the proposed class-group realization of finite-field discrete-logarithm systems.
Let K be a graph and let K^squareunderline 2 be its deleted Cartesian square. Consider left cycles, right cycles, off-diagonal cycles, symmetrized cycles, triadic cycles, boundaries, symmetric 1-cycles, symmetrized boundaries, and…
Suppose A⊂ G, and |A+A|≤ K |A|. Can we find a subset A'⊂ A with |A'|≥ K^-O(1)|A| and a group H so that A' is Freiman isomorphic to a subset of H and |H|≤ K^O(1)|A|?
Let A_n denote the set of score vectors attainable in tournaments on n players, and let A^*_n denote the region generated by the tournament configurations described above. The examples satisfy A^*_1=A_1, A^*_2=A_2, and A^*_3=A_3. Equality…
Let K_n be the complete graph on n vertices. The online size Ramsey number tilder(K_n,K_n) is the least number of rounds needed for Builder to force a red or blue copy of K_n, while the size Ramsey number hatr(K_n,K_n) is the least number…
Point-determining graph conjecture. The number of unlabelled point-determining graphs of a given order equals the number of unlabelled endpoint-free graphs of that order. This proposes an enumerative correspondence between two classes of…
Let R(n;k,r) be the smallest N such that if the edges of K_N are r-coloured then there is a set of n vertices which does not contain a copy of K_k in at least one of the r colours. Prove that there is a constant C=C(r)>1 such that R(n;3,r)…