Related papers: Linear Algebraic Method and the Erd\H{o}s-Heilbron…
Concise introduction to a relatively new subject of non-linear algebra: literal extension of text-book linear algebra to the case of non-linear equations and maps. This powerful science is based on the notions of discriminant…
In this paper we introduce the notion of existentially closed Leibniz algebras. Then we use HNN-extensions of Leibniz algebras in order to prove an embedding theorem.
The Hahn-Banach theorem states that onto each line in every normed space, there is a unitary projection, and Kadec and Snobar proved (using John's ellipsoid) that onto each $n$-dimensional subspace of any real normed space, there is a…
The Casas-Alvero conjecture predicts that every univariate polynomial over an algebraically closed field of characteristic zero sharing a common factor with each of its Hasse-Schmidt derivatives is a power of a linear polynomial. The…
We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We show that the subspace constraint leads to an accelerated…
In a seminal paper, Alon and Tarsi have introduced an algebraic technique for proving upper bounds on the choice number of graphs (and thus, in particular, upper bounds on their chromatic number). The upper bound on the choice number of $G$…
We amalgamate two generalizations of Ramsey's Theorem--Ramsey classes and the Erd\H{o}s-Rado Theorem--into the notion of a combinatorial Erd\H{o}s-Rado class. These classes are closely related to Erd\H{o}s-Rado classes, which are those from…
Using class field theory, we prove a restriction on the intersection of the maximal abelian extensions associated with different number fields. This restriction is then used to improve a result of Rosen and Silverman about the linear…
We obtain new bounds on short Weil sums over small multiplicative subgroups of prime finite fields which remain nontrivial in the range the classical Weil bound is already trivial. The method we use is a blend of techniques coming from…
We solve a case of the Abelian Exponential-Algebraic Closedness Conjecture, a conjecture due to Bays and Kirby, building on work of Zilber, which predicts sufficient conditions for systems of equations involving algebraic operations and the…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
To the best of our knowledge, a complete characterization of the domains that escape the famous Arrow's impossibility theorem remains an open question. We believe that different ways of proving Arrovian theorems illuminate this problem.…
We prove one direction of a recently posed conjecture by Gan-Gross-Prasad, which predicts the branching laws that govern restriction from p-adic $GL_n$ to $GL_{n-1}$ of irreducible smooth representations within the Arthur-type class. We…
This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…
We introduce Veronese-Avoiding hypersurfaces, inspired by the theory of associated forms of Alper--Isaev. In the smooth case, we reinterpret their criterion via Macaulay inverse systems: the Veronese-Avoiding condition is equivalent to the…
Reduction algebras (also known as generalized Mickelsson algebras, Zhelobenko algebras, or transvector algebras) are well-studied associative algebras appearing in the representation theory of Lie algebras. In the 1990s, Zhelobenko noted…
By using random multilinear maps, we provide new lower bounds for the Erd\H{o}s box problem, the problem of estimating the extremal number of the complete $d$-partite $d$-uniform hypergraph with two vertices in each part, thereby improving…
We analyze the convergence of the one-level overlapping domain decomposition preconditioner SORAS (Symmetrized Optimized Restricted Additive Schwarz) applied to a generic linear system whose matrix is not necessarily symmetric/self-adjoint…
We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…
We develop a purely combinatorial theory of limit linear series on metric graphs. This will be based on the formalisms of hypercube rank functions and slope structures. We provide a full classification of combinatorial limit linear series…