Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
The problem COMPUTECHARBINARY is GapP-complete under many-one reductions.
If G=(V, E) is self-complementary and vertice-transitive,then ρ^⊥(G)=⌈ n/2 ⌉
Suppose that the graphs Γ_1 and Γ_2 have the same refined spectra. Are their complements cospectral?
Give a sharp upper bound on γ(X(G)) in terms of γ(G) for any connected graph G with δ(G) ≥ 2, where γ denotes the domination number.
Let \alpha, \beta and \mu be partitions of the same size. The generating function \sum_{N \ge 0} L_{N\alpha,N\beta}^{N\mu}(q) t^N is a rational function of q and t.
Charactrize all graphs G which diam(G)=2 and diam(D_{2}(G))=2 or 3.
Do there exist polynomials f_{1}(\zeta),f_{2}(\zeta),f_{3}(\zeta) and f_{4}(\zeta) in \zeta of order 6 , given as in (15), satisfying (16) and (17), such that f_{1}(1)=0,\quad f_{2}(1)^{2}=f_{3}(1)^{2}=f_{4}(1)^{2}=3^{2}?
It meets ρ^⊥(G)>ρ^⊥(V_c) if it meets the following: - ρ^⊥(V_c)>ρ^⊥(A) - ρ^⊥(V_c)>ρ^⊥(B) - ρ^⊥(V_c)≤ ρ^⊥(A)+ρ^⊥(B)
Note that the divisibility conditions in (22) should be equivalent to those in (23) if a t-(n,k,λ) exists. It is open if they are equivalent.
No two non-isomorphic H-shape trees are L-cospectral.
if n is odd then there exist isometric embeddings of \frac{1}{2}H_{n} in the half-spin Grassmann graphs of \Pi whose images are not apartments.
In fact, what can be said (in general) about the connected components of these graphs: are they all paths or cliques ?
If ζ(α) = ζ(β), are α and β necessarily related by switching?
Let S be the parameter matrix of a k-transversal in a d-uniform r-regular hyper graph G. Then the characteristic polynomial of S is φ(λ)=λ^d-2∏_i=j^d(λ-ξ^jkr), where ξ is a d-th primitive root of unity.
Characterize the nontrivial lexicographic product graphs that are well-totally-dominated.
Let k≥ 2, let S_k be the symmetric group on k letters, and let g: S_k→ R be any function. For nonnegative numbers γ_1,…,γ_k-1, with an empty sum interpreted as zero and (ij)∈ S_k denoting the transposition of i and j, the…
Let ε>0, let S⊂ U(d) be a symmetric Haar random gate-set containing at least 3 elements, and let λ be an irreducible representation with dimension d_λ. Let δ(ν_S,λ) be the corresponding representation-sector deviation, and let F_*(d_λ,ε)…
Let q be a power of an odd prime, let U_n(q) be the unitriangular group of degree n over the finite field F_q, and let N_n,e(q) denote the number of irreducible characters of U_n(q) with degree q^e, for e∈ N. Isaacs's conjecture. The…
Let check G be a connected reductive algebraic group over F=Q_p, let G be its Langlands dual group, and let Λ:W_F→^Lcheck G be an infinitesimal character. Let E_Λ be the Vogan variety with its G_Λ=Z_G(Λ)-action, and let Rep_Λ(check G_δ)…
Let d∈ N, let A∈ M_d, and let Δ_A be the function defined from sequences of partitions whose normalized limits are p∈ P([d]) and s∈ P^downarrow([d]), with the value determined by the corresponding asymptotic trace expression when ssucceq…