Related papers: Wilf's conjecture in fixed multiplicity
A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…
The well-known Dixmier conjecture asks if every algebra endomorphism of the first Weyl algebra over a characteristic zero field is an automorphism. We bring a hopefully easier to solve conjecture, called the $\gamma,\delta$ conjecture, and…
In this paper, we treat an open problem related to the number of periodic orbits of Hamiltonian diffeomorphisms on closed symplectic manifolds, so-called generic Conley conjecture. Generic Conley conjecture states that generically…
In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…
The inversion formula is given for automorphisms of the Weyl algebras with polynomial coefficients over a field of characteristic zero. The theorem of Gabber on the degree of polynomial automorphism is extended. It is proved that any…
The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. A family Fc is called Frankl-complete (or FC-family) if in every…
We prove the Conley conjecture for a closed symplectically aspherical symplectic manifold: a Hamiltonian diffeomorphism of a such a manifold has infinitely many periodic points. More precisely, we show that a Hamiltonian diffeomorphism with…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
Associated to an abelian variety over a number field are several interesting and related groups: the motivic Galois group, the Mumford-Tate group, $\ell$-adic monodromy groups, and the Sato-Tate group. Assuming the Mumford-Tate conjecture,…
We present a conjecture on multiplicity of irreducible representations of a subgroup $H$ contained in the irreducible representations of a group $G$, with $G$ and $H$ having the same derived groups. We point out some consequences of the…
By a global approach, we prove the arithmetic fundamental lemma conjecture for unitary groups in $n$ variables over $\mathbb{Q}_p$ when $p\geq n$.
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…
Kanel-Belov and Kontsevich's conjecture in \cite[Conjecture 1]{BeKo} is proved: The automorphism group of the $n$-th Weyl algebra is isomorphic to the Poisson automorphism group of the $n$-th Poisson Weyl algebra.
We will prove that the Pierce-Birkhoff Conjecture holds for non-singular two-dimensional affine real algebraic varieties over real closed fields, i.e., if W is such a variety, then every piecewise polynomial function on W can be written as…
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…