Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let G be a planar triangulation with uniform volume growth faster than quadratic. Must p_c(G)<1? More strongly, is p_c(G)=1/2?
Given a rank-one update X_new=X+ab^T=UW+ab^T with U∈St(n,p), define widetilde q=(I-UU^T)a, q=widetilde q/|widetilde q|, widetilde w=-W^-Tb, w=widetilde w/|widetilde w|, ω=1/|widetilde q|(1-a^TUwidetilde w), g=(widetilde w,ω)^T,…
Let (A,Θ) be a principally polarized abelian variety, and for a fixed p∈ P^g-1 let Z_p⊂ |2Θ| be the linear system generated by the divisors Θ_x∪Θ_-x where x lies in Θ^rm sing or in the fiber G^-1(p) of the Gauss map. Since x∈Θ, the origin…
Consider the given imbalanced (m,2k+1)-RPS game and a Nash equilibrium N. Let P_i(S) be the probability that player i plays S, and let P_i(T_p) be the probability that player i plays any P-type object. Imbalance conjecture. For every…
Let n ≥ 3 and let Ω ⊂ R^n be a bounded Lipschitz domain. Suppose that γ_1,γ_2 ∈ W^1,n(Ω) are uniformly elliptic, and let Λ_γ_i denote the corresponding Dirichlet-to-Neumann maps. Brown's conjecture. Λ_γ_1=Λ_γ_2 Longleftrightarrow γ_1=γ_2.…
Let G be a finite, simple, undirected graph of order n, and call a vertex set a forest cut if it is a vertex cut whose induced subgraph is a forest. Forest-cut conjecture. If G has less than 3n-6 edges, then G has a forest cut. Maximal…
Let X be a smooth projective complex variety and let m be a nonnegative integer. Say that CH_0(X) is supported on an m-dimensional algebraic subset V⊂ X when the pushforward map CH_0(V)→CH_0(X) is surjective. Generalized Bloch conjecture.…
Let Θ_k index the multivariate Hermitian Jacobi polynomials tildeP^(α,β)_τ_1,…,τ_k;φ, defined by triangular expansion in the multivariate Schur polynomials with respect to the matrix beta distribution MB_k,m^(α,β). Let (τ_1,…,τ_k;φ) and…
Let (a_n) be the sequence under consideration, and call a prime divisor of a_n primitive if it does not divide any earlier term a_k with k<n. Primitive divisor conjecture. The term a_n has a primitive prime divisor for all but finitely…
Let (Γ,g,G) be an abelian gain graph, where G is a torsion-free abelian group, possibly 2-divisible. Let Z_1(Γ) be the integral cycle group, and suppose it has a basis consisting of balanced circles with at most 3 edges. Three-edge…
Consider an additive white Gaussian noise multiway relay channel (AWGN MWRC) with relay power P_0=LP, where L is the number of users and P is the user power. Let R_CF, R_CDF, and R_FDF denote the achievable rates of compress-forward,…
Find sufficient conditions, in terms of properties of the energy density W that are easy to check, such that W^rc can be computed with a laminate of finite order.
How many regular tetraheadra in R^3 can touch at a single point? Follow-up comments/question: How many regular tetrahedra with side length =1 fit into a unit ball?
Is each Artin group isomorphic to its dual?
Let θ otinQ and let 4x=x_n_n with x_n=nθ. For a continuous function f, write A_[N]f(x)=1/N∑_n∈[N]f(nθ). We say that these averages fluctuate when they are infinitely often greater than and infinitely often less than their limiting value;…
Let U be the interaction appearing in the Hamiltonian, let β^* be an inverse temperature, and let β^*(λ) and x^*=e^-2β^*J be as below. For a finite domain Ω⊂V^•, let ξ=(h_1,h_2,…,h_2N) be a collection of vertices in the relevant…
Determine the most appropriate strain-energy function to describe the behaviour of a given material.
Let K_4^- be the 3-graph on four vertices with three edges, and let π(K_4^-) denote its Turán density. Frankl–Füredi–Razborov conjecture. π(K_4^-)=2/7. The conjectured value comes from the balanced iterated blow-up of H_6. The source gives…
Let a weakly locally finite division ring be a division ring in which every finite subset generates a centrally finite division subring over the prime subfield, and let a Stewart's division ring be a division ring that is locally finite…
Let r_4(5,n) be the off-diagonal Ramsey number for 4-uniform hypergraphs, the least N such that every red-blue coloring of the 4-edges of an N-vertex complete hypergraph contains a red copy of the complete 4-uniform hypergraph on 5…