Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Erdős-Gyárfás: Is it true that every graph whose vertices have odd degree greater than one contains a cycle of length 2^(n) for some n? This one has kept me (and apparently, lots of others) up many a night trying fruitlessly to construct a…
C.5 Applications A. From number theory: Consider one polynomial in one variable with integer coeffi-cients, written as a straight line program of complexity τ. How many roots are there which are congruent to 1 modulo p, as a function of…
Chapter I: Synaptic Integration in the Early Visual Pathway Judith Hirsch Discussion after the presentation. Q: Isn't there a push-pull mechanism in the retina? 10 A: Yes I think there is. But it has to be recreated in the thalamus because…
Do the Ulam numbers have a positive density?
For various subgroups H <Modg, compute the density of spec(H) in spec(Modg) and the density of H∩Pg inPg. In particular, what is the density of spec(Modg[L]) in spec(Modg)? What about H =Ig(k) with k≥ 1?
Does the generalized continuum hypothesis below a strongly compact cardinal imply it everywhere?
- Determine all decomposition numbers of the symmetric group S_n over a field of prime characteristic.
Determine all decomposition numbers of the symmetric group S_n over a field of prime characteristic.
ℓ^2-torsion Clay shows that ℓ^2-torsion vanishes for free-by-cyclic groups with polynomially-growing monodromies \cite{MR3667215}. If G is a free-by-cyclic group with exponentially growing monodromy then it has non-vanishing ℓ^2-torsion.
Let k(n) be the maximum number of regions meeting at one point in an area-minimizing partition in n dimensions. Determine the growth of k(n) and whether it is strictly increasing; investigate the analogue for other surface energies.
Is there an algorithm to compute ‘distance’ in the cut complex of a trisection? Is the L-invariant computable?
But it is also not impossible that all manifolds admit immersions into the unit ball in the Hilbert spaceR∞with principal curvatures bounded by a universal constant, say by 1 000 000.
For every hyperbolic knot K\subset S^3, the Volume Conjecture predicts \lim_{N\to\infty}\frac{2\pi\log J_N(K)}{N}=\operatorname{Vol}(K)+\sqrt{-1} \operatorname{CS}(K).
Problem 4.13 (Brought by V. Lev, originally stated by Konyagin and the presenter). Suppose we are given r ≥ 1 points z1,..., z r on the unit circle and corresponding non-negative weights p1,..., p r, normalized by the condition p1 + · · ·…
Suppose that the polynomials p_1,…, p_ℓ∈ Z[t] are pairwise independent. Show that there exists d∈ N such that the factors Z_d,T_1, …, Z_d,T_ℓ are characteristic factors for the averages (source reference E:Multies).
Open problem: In our work, the submatrix decomposition is asymptotically i.i.d. for block \sqrt{ } size k with \omega(1) \leq k \leq o(n), and the compression algorithm is\sqrt{ }universal for k \leq \delta log n, with n being the size of…
Complete the above table: {\rm (1)} construct new examples of natural Hamiltonian systems on closed two-dimensional surfaces admitting polynomial integrals, describe and, if possible, classify them; {\rm (2)} prove, if possible,…
Let G=(V,E) be an undirected graph and let (s_1,t_1), (s_2,t_2) be two node pairs. Give a combinatorial, polynomial-time algorithm to find edge-disjoint s_1-t_1 and s_2-t_2 paths with minimum total length.
Conjecture 1.1 using this last hypothesis. 2Comment 1.3 Section 3 of Kirwan's manuscript deals with the case where the group is abelian. The participants at the AIM workshop tentatively agreed that in this case, under the hypotheses of the…
If two sequences of warped-cone levels are weak-equivalent, meaning that subsequences coarsely embed into one another in both directions, how much does this equivalence determine about the dynamics of the underlying group actions?
Conjecture 6. 1 9. (Bermond-Thomassen) In a digraph D with δ+ D ≥ 2k − 1, there are k vertex disjoint cycles. Notes: Open for k ≥ 3, and the proof for k = 2 by Thomassen is not intuitive.