Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Give another proof of the paper's identities (Ж) and (ж) using the methods for identity (1). Can f(a,b,c,d) be interpreted as a residue at (a+b)+(c+d)i, or otherwise related to the Gaussian integers?
For the longest K_t-sequence rank function r_t on E(K_n), is r_t submodular, so that (E(K_n),r_t) forms a matroid?
Let g_d(n) denote the minimal number of peeling sequences of n points in R^d. Here c and epsilon are positive constants. Peeling-sequence growth conjecture. The minimal number of peeling sequences of n points in R^d is at least c(d+1+ε)^n,…
Let (u_k)_k≥1 be Arnold's sequence, and let f be the map on finite sequences of nonnegative integers defined in the paper. Starting from a finite sequence, repeatedly applying f produces an infinite sequence called its f-transform.…
Let G be an n-vertex graph. Write f(G) for the maximum number of distinct degrees in an induced subgraph of G, and let hom(G) denote the maximum size of a homogeneous set in G. Large-homogeneous-set conjecture. If hom(G)>n^1/2, then…
Let G be a graph with v vertices and b blocks, and let A_m be the algebra used to define its chromatic homology. Write H_*,*^A_m(G) for the resulting bigraded chromatic homology and let hspan denote its homological span.…
In every triangle-free graph, is the ratio of the maximum independent-set size to the average independent-set size at least 4/3; and in every triangle-free graph of minimum degree d, is that ratio at least 2-o_d(1)?
A cyclic (n_k) configuration is a cyclic configuration in which every point lies on k lines and every line contains k points. Unsplittability conjecture. All cyclic (n_k) configurations for k ≥ 4 are unsplittable. The claim is motivated by…
Work efficiently with the testing characters and principal homogeneous spaces without constructing them explicitly.
Let overrightarrowG and overrightarrowH be directed trees, and let X_overrightarrowG(x,t) denote the chromatic quasisymmetric function of a directed graph. The chromatic quasisymmetric function conjecture. If overrightarrowG and…
Does there exist a vertex-transitive graph whose multiplicative rough-isometry constants to its k-net graphs tend to 1 as k→∞?
Use algebraic tools to solve computational problems on ideal lattices efficiently.
Let G be a graph with n vertices and m edges, let b be the number of blocks of G, and let span_0(G) denote the homological span of its degree-0 chromatic symmetric homology. Span bounds conjecture. The homological span satisfies n-b ≤…
Let b_m(n) denote the Bernoulli partition entries described in the preceding discussion, and let B_2m be the Bernoulli numbers. For each column index n≥ 2, define the asymptotic ratio a(n) by fracb_m(n)|B_2m|undersetm→∞~a(n). Let ⌊·⌋…
Let S_g be a compact orientable surface of genus g>0, and let G be a graph with n vertices and m edges. Cairns–Nikolayevsky's conjecture. If G can be thrackled on S_g, then m≤ n+2g. Odd cycles and recursive constructions provide examples…
Every 2-connected cubic graph with no Petersen-graph minor admits a proper edge-coloring with 3 colors; equivalently, its edges can be partitioned into 3 matchings.
Let Q_n denote the n-dimensional hypercube. A graph is path-pairable if every pairing of its vertices can be linked by pairwise edge-disjoint paths. Odd-dimensional hypercube conjecture. The (2k+1)-dimensional hypercube Q_2k+1 is…
Let T(n,k) denote the set of strings of length n over the paper's alphabet, and let S⊆T(n,k) be closed under rotations. Given a string α∈T(n,k), an α-suffix language is a set of strings such that, whenever β=b_1… b_n belongs to it and…
For each n, let D_n be a distribution over graphs of n vertices. A projective sampling scheme is as follows. For any k < n we have a procedure to, given a sample from D_n, choose k vertices so that the induced subgraph is distributed…
Given Aut(G), what are the number of non-isomorphic zero forcing sets. In particular, what about circulates? This can have implications for propagation time because it is probably true that `isomorphic' zero forcing sets have the same…