Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let a minimal-ABC tree be a tree minimizing the atom-bond connectivity index among trees of the relevant order, and let a B_2-branch denote the branch type used in the paper's classification of such trees. Nine-B_2-branch conjecture. A…
Speed up rotation-augmented reduction algorithms for cyclic or NTRU lattices.
Let F be a clause-set with at most one conflict between any two clauses. Write δ(F) for its deficiency and δ_χ(F):=c(F)-χ(cg(F)) for its colouring deficiency, where c(F) is the number of clauses, cg(F) is the associated conflict graph, and…
Let m and n be positive integers with m| n, and let a<b<minm,n. Consider the random walk on Z_m×Z_n whose moves are (+a,+b) and (+b,+a), with winning positions determined by the game. Harrington et al.'s divisibility conjecture. If all…
If A,B⊂ 1,…,N are two Sidon sets such that (A-A)∩(B-B)=0 then is it true that binomlvert Arvert2+binomlvert Brvert2≤binomf(N)2+O(1), where f(N) is the maximum possible size of a Sidon set in 1,…,N? If lvert Arvert=lvert Brvert then can…
Does every finite connected vertex-transitive graph have a Hamiltonian path?
: Given two permutations σ and τ, what is the expected number of copies of σ in a permutation chosen uniformly at random from those permutations on n symbols which avoid τ? Newsflash! Miklós Bóna has a nice paper addressing this.
Define A_n(t) =∑_λvdash n∏_Box∈λfrach_Box^2+th_Box where h_Box is the hook length of Box. Consider the problems: \begin{itemize} \item Prove Unimodality \item Prove that A_n(t) has only negative real roots. \item Prove that A_n(t) has only…
Call a graph G of order n prime if its vertices can be bijectively labelled by 1,\ldots,n so that adjacent vertices receive coprime labels. Is every tree prime?
Let k and l be integers at least 2 of opposite parity, with k≥ 2l+1 if k is odd and k≥ 2l-2 if k is even, and set d=1/2(3k+l+1). Here S(d,k,k+l) denotes the maximum length of a circuit code with parameters (d,k,k+l), and K(d,k) denotes the…
Let G be a connected block graph, meaning a graph in which every biconnected component is a clique. The nullity of G is the dimension of the kernel of its adjacency matrix. Nullity conjecture. If each block of G has order at least 3, then…
Is there an improved design of Deep Material Networks (e.g., different building blocks, different hierarchy) which is expressive? Is there an underlying theory which explains why elastic training suffices for inelastic applications? Can this…
Let d be a positive real number, and let G be a triangle-free graph with minimum degree at least d. An induced bipartite subgraph of G is a bipartite subgraph induced by a subset of the vertices of G, and its average degree is the average…
The d-1 numbers α^β, α^β^2,…, α^β^d-1 are algebraically independent over Q.
Construct an efficient ideal-lattice version of Regev's quantum-SVP-based cryptosystem.
Let a Hist-snark be a snark with a Hist, where a Hist is a spanning tree having only vertices of degree three and one, and the outer cycles are the vertex-disjoint cycles induced by the edges outside the Hist. A cycle double cover is a…
Determine conditions for a poset (G, preceq) where G is the set of graphs with a minimum size power dominating (zero forcing) set.
Let G be a bridgeless cubic graph. An S^2-flow is a unit vector flow with values on the unit sphere S^2. Bobby's spherical flow conjecture. Every bridgeless cubic graph has an S^2-flow. This conjecture is proposed as one of two conjectures…
Finding almost subspace inside A+A Let A⊂ F_2^n be a set of density α. Then there is a subspace V of codimension log^O(1)(ε^-1α^-1) so that |V∩ (A+A)|≥ (1-ε)|V|
Given integers n and a prime power q, construct, when possible, an elliptic curve E/F_q with #E(F_q)=n.