Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let P(x) have roots r_1,r_2,…,r_i, with respective multiplicities 1,m_2,…,m_i, where m_j≥ 1 for 2≤ j≤ i≤ k. Let a_1 be the coefficient of the principal root in the Binet expansion of q(1,t), and let Q_0(x) denote the polynomial used by the…
Let APrism_m be the m-parameter antiprism, and let Prism(APrism_m) denote the prism over it. Write z for the zigzag vector and Int for intersection vectors. Prism-over-antiprism conjecture. The prism over APrism_m has…
Problem for every graph G, we let L(G) denote the line graph of G. Given that G is a tree, can we determine it from the integer sequence |V(G)|, |V(L(G))|, |V(L(L(G)))|, …?
Develop theory of partial zero forcing/unique paths that Bryan Shader talked about.
Conjecture Do any three longest paths in a connected graph have a vertex in common?
Let G be an Eulerian planar triangulation, meaning a planar triangulation whose vertices all have even degree. A vertex set is acyclic when it induces a forest. Dual Barnette conjecture. The vertices of G can be partitioned into two…
For each positive integer n≥ 1 there exists a positive number c(n) such that, if underlineα=(α_1,…,α_n) is a n-tuple of multiplicatively independent algebraic numbers, then h(1colon α_1colon …colon α_n)≥c(n)over ω(underlineα).
Let P∈C[x] be a polynomial, let Λ=(λ_1,…,λ_m) be an m-tuple of distinct complex numbers, and let D_P(Λ) denote the associated m×(n+1) dope matrix. For generic Λ, write D_n^gen(m) for the set of such matrices. Genericity conjecture. For m≥…
For any finite union-closed family of sets, does some element appear in at least half the sets?
Let G be a connected graph, and let tmc(G), respectively mc(G), denote its total monochromatic connection number, respectively monochromatic connection number. Total monochromatic connection conjecture. For a connected graph G, it always…
Conjecture Let ℓ ≥ 2 be an integer. For every integer n≥ 0, there exists an integer t_n=t_n(ℓ) such that for every digraph D, either D has a n pairwise-disjoint directed cycles of length at least ℓ, or there exists a set T of at most t_n…
Let G be an [4]-coverable graph. For each t, let s^t(G) denote the cardinality of a largest t-splitting set of G, where a t-splitting set is a subgraph whose [t+1]-matchings cannot be extended to an [4]-matching of G and which has an…
Let n≥ 5 with n≡ 0,5pmod 6 and k=⌊ (n+2)/6⌋. Let G_n,k be the graph from the paper, and let overlineG_n,k∖ v denote the graph obtained by deleting any vertex v from its complement. A minimal prime graph is a graph with the minimal-prime…
In mathematics, the theory of Latin squares is an active research area with many open problems. As in other areas of mathematics, such problems are often made public at professional conferences and meetings. Problems posed here appeared…
Let (X,d) be a finite metric space. Its tight-span T(d) is the polytopal complex of minimal elements, under the product order, of P(d):=f∈R^X:f(x)+f(y)≥ d(x,y) for all x,y∈ X. Let G_d be the weighted graph consisting of the zero- and…
Is there some constant c>0 such that for every n≥ 1 there exists some δ_k∈ -1,0,1 for 1≤ k≤ n with 0< lvert ∑_1≤ k≤ nδ_k/krvert < c/2^n? Is it true that for sufficiently large n, for any δ_k∈ -1,0,1, lvert ∑_1≤ k≤ nδ_k/krvert > 1/[1,…,n]…
What is ex_3(n,K_4^3)? That is, the largest number of 3-edges which can placed on n vertices so that there exists no K_4^3, a set of 4 vertices which is covered by all 4 possible 3-edges.
Let G=(V,E) be a graph and let bc be a probability distribution on V. Consider the stochastic sandpile model (SSM) on G in which grain additions are made according to bc. Selig's conjecture. The stationary distribution for this SSM does…
For positive integers t and d, let K_t(d) denote the complete t-partite graph with each part of size d. Let f be a function and let c be a constant. Sigma clique covering growth conjecture. For every positive integers t and d, if t≥ f(d),…
Is complete integer factorization deterministically polynomial-time reducible to discrete logarithms modulo composites?