Related papers: On Kronecker's Solvability Theorem
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
Fourier-Motzkin elimination, a standard method for solving systems of linear inequalities, leads to an elementary, short, and self-contained proof of von Neumann's minimax theorem.
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We give a motivated introduction to the theory of perverse sheaves, culminating in the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber. A goal of this survey is to show how the theory develops naturally from classical…
A Lefschetz module is a module over a graded algebra $A$ that satisfies analogues of Poincar\'{e} duality, the Hard Lefschetz property, and the Hodge--Riemann relations with respect to an open convex cone $\mathscr{K}$ in the degree one…
In this note we develop some properties of those algebras (called here locally simple) which can be generated by a single element after, if need be, a faithfully flat extension. For finite algebras, this is shown to be in fact a property of…
A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles.…
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
For an acyclic quiver with three vertices, we consider the canonical decomposition of a non-Schurian root and associate certain representations of a generalized Kronecker quiver. These representations correspond to points contained in the…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
We discuss the explicit construction of the Schroedinger equations admitting a representation through some family of general polynomials. Almost all solvable quantum potentials are shown to be generated by this approach. Some generalization…
We explain a correct proof of the decomposition theorem for direct images of constant Hodge modules by proper K\"ahler morphisms of complex manifolds. We also give some examples showing certain difficulty in the non-constant Hodge module…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…
Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
Many of the strengthenings and extensions of the topological Tverberg theorem can be derived with surprising ease directly from the original theorem: For this we introduce a proof technique that combines a concept of "Tverberg unavoidable…
We give in the present work a new methodology that allows to give isoperimetric proofs, for Kneser's Theorem and Kemperman's structure Theory and most sophisticated results of this type. As an illustration we present a new proof of Kneser's…
In 2002, it was conjectured that a free divisor satisfying the so-called Logarithmic Comparison Theorem must be strongly Euler-homogeneous and it was proved for the two-dimensional case. Later, in 2006, it was shown that the conjecture is…