Related papers: Linear Algebraic Method and the Erd\H{o}s-Heilbron…

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower…

We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…

The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \mathbb{R}^d$, any $x\in \mathbb{R}^d$, and uniformly random $(\xi_1,\dots,\xi_n)\in\{-1,1\}^n$, we have…

Realization by linear vector fields is constructed for any Lie algebra which admits a biorthogonal system and for its any suitable representation. The embedding into Lie algebras of linear vector fields is analogous to the classical…

A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…

We give a proof of the Erd\H{o}s-Ko-Rado Theorem using the Borel Fixed Point Theorem from algebraic group theory. This perspective gives a strong analogy between the Erd\H{o}s-Ko-Rado Theorem and (generalizations of) the Gerstenhaber…

Resolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted Res(lin_R), this refutation system operates with disjunctions of linear…

We obtain a new addition theorem for the fundamental solution of the Navier-Lam\'e system in dimension 3 satisfying the Kupradze radiation conditions. This provides an expansion of this fundamental solution that involves only the evaluation…

We generalise the Elekes-Szab\'o theorem to arbitrary arity and dimension and characterise the complex algebraic varieties without power saving. The characterisation involves certain algebraic subgroups of commutative algebraic groups…

We analyze the convergence of the (algebraic) multiplicative Schwarz method applied to linear algebraic systems with matrices having a special block structure that arises, for example, when a (partial) differential equation is posed and…

Using special quasigraded Lie algebras we obtain new hierarchies of integrable nonlinear vector equations admitting zero-curvature representations. Among them the most interesting is extension of the generalized Landau-Lifshitz hierarchy…

In this paper we introduce techniques from complex harmonic analysis to prove a weaker version of the Geometric Arveson-Douglas Conjecture for complex analytic subsets that is smooth on the boundary of the unit ball and intersects…

In this paper, we provide an alternative proof of Donaldson's almost-holomorphic section theorem and symplectic Lefschetz pencil theorem, through constructions of certain special kind of Donaldson-type sections of the line bundle based on…

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

We prove a new lower bound on the algorithmic information content of points lying on a line in $\mathbb{R}^n$. More precisely, we show that a typical point $z$ on any line $\ell$ satisfies \begin{equation*} K_r(z)\geq \frac{K_r(\ell)}{2} +…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…