نتایج جستجو برای: composition conjecture
تعداد نتایج: 296425 فیلتر نتایج به سال:
We give a polynomial counterexample to both the Markus-Yamabe Conjecture and the discrete Markus-Yamabe problem for all dimensions ≥ 3.
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
The Erdős–Faber–Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than one vertex, then χ(G) = n. We provide a formulation of this conjecture in terms of maximal partial clones of partial operations on a set.
The set of min-max functions F : R n ! R n is the least set containing coordinate substitutions and translations and closed under pointwise max, min, and function composition. The Duality Conjecture asserts that the trajectories of a min-max function, considered as a dynamical system, have a linear growth rate (cycle time) and shows how this can be calculated through a representation of F as an...
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture, which would imply the Lovasz conjecture and give an interesting insight on the symmetry of vertex-transitive graphs, if true. Though it could become an approach ...
let $g$ be a finite group and let $text{cd}(g)$ be the set of all complex irreducible character degrees of $g$. b. huppert conjectured that if $h$ is a finite nonabelian simple group such that $text{cd}(g) =text{cd}(h)$, then $gcong h times a$, where $a$ is an abelian group. in this paper, we verify the conjecture for ${f_4(2)}.$
We study H∗(P ), the mod p cohomology of a finite p–group P , viewed as an Fp[Out(P )]–module. In particular, we study the conjecture, first considered by Martino and Priddy, that, if eS ∈ Fp[Out(P )] is a primitive idempotent associated to an irreducible Fp[Out(P )]–module S, then the Krull dimension of eSH ∗(P ) equals the rank of P . The rank is an upper bound by Quillen’s work, and the conj...
this note introduces a new general conjecture correlating the dimensionality dt of an infinitelattice with n nodes to the asymptotic value of its wiener index w(n). in the limit of large nthe general asymptotic behavior w(n)≈ns is proposed, where the exponent s and dt are relatedby the conjectured formula s=2+1/dt allowing a new definition of dimensionality dw=(s-2)-1.being related to the topol...
We conjecture that every nite group G has a short presentation (in terms of generators and relations) in the sense that the total length of the relations is (log jGj) O(1). We show that it suuces to prove this conjecture for simple groups. Motivated by applications in computational complexity theory, we conjecture that for nite simple groups, such a short presentation is computable in polynomia...
In this note we prove a conjecture from [DFJMN] on the asymptotics of the composition of n quantum vertex operators for the quantum affine algebra Uq(ŝl2), as n goes to ∞. For this purpose we define and study the leading eigenvalue and eigenvector of the product of two components of the quantum vertex operator. This eigenvector and the corresponding eigenvalue were recently computed by M.Jimbo....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید