相关论文: On the uncommonness of minimal rank-2 systems of l…

A system of linear equations $L$ is common over $\mathbb{F}_p$ if, as $n\to\infty$, any 2-coloring of $\mathbb{F}_p^n$ gives asymptotically at least as many monochromatic solutions to $L$ as a random 2-coloring. The notion of common linear…

A system of linear equations in $\mathbb{F}_p^n$ is \textit{common} if every two-colouring of $\mathbb{F}_p^n$ yields at least as many monochromatic solutions as a random two-colouring, asymptotically as $n \to \infty$. By analogy to the…

A system of linear equations $L$ over $\mathbb{F}_q$ is common if the number of monochromatic solutions to $L$ in any two-colouring of $\mathbb{F}_q^n$ is asymptotically at least the expected number of monochromatic solutions in a random…

We study the problem of solvability of linear differential systems with small coefficients in the Liouvillian sense (or, by generalized quadratures). For a general system, this problem is equivalent to that of solvability of the Lie algebra…

A system of linear equations in $\mathbb{F}_p^n$ is \textit{Sidorenko} if any subset of $\mathbb{F}_p^n$ contains at least as many solutions to the system as a random set of the same density, asymptotically as $n\to \infty$. A system of…

A fundamental result in linear algebra states that if a homogenous linear equation system has only the trivial solution, then there are at most as many variables as equations. We prove the following generalisation of this phenomenon. If a…

We show that a minimal counter example to the Cherlin-Zilber Algebraicity Conjecture for simple groups of finite Morley rank has normal 2-rank at most two, which is a tameness free version of Borovik's original trichotomy theorem. This…

A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…

We prove that a generic linear cocycle over a minimal base dynamics of finite dimension has the property that the Oseledets splitting with respect to any invariant probability coincides almost everywhere with the finest dominated splitting.…

Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…

We study and solve several problems in two closely related settings: set families in $2^{[n]}$ with many disjoint pairs of sets and low rank matrices with many zero entries. - More than 40 years ago, Daykin and Erd\H{o}s asked for the…

We study linear equations in combinatorial Laplacians of $k$-dimensional simplicial complexes ($k$-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacians play a crucial role in homology and are a central tool in…

We prove that for many ranks r<2m-2, random rank r mixed states in bipartite mxm systems have relatively high Schmidt numbers, which is based on algebraic-geometric separability criterion proved in [1]. This also means that the…

We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…

We introduce a new class of "random" subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We establish necessary and sufficient conditions for solvability of…

The completeness of the group classification of systems of two linear second-order ordinary differential equations with constant coefficients is delineated in the paper. The new cases extend what has been done in the literature. These cases…

Two theorems witnessing the abundance of geometrically trivial strongly minimal autonomous differential equations of arbitrary order are shown. The first one states that a generic algebraic vector field of degree $d\geq 2$ on the affine…

A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…

We consider the Lane-Emden conjecture which states that there is no non-trivial non-negative solution for the Lane-Emden system whenever the pair of exponents is subcritical. By Sobolev embeddings on $S^{N-1}$ and scale invariance of the…

We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa's result that there are no minimal pairs for relative generic computability, and answers a…