Related papers: Feasible combinatorial matrix theory
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
Using techniques from the theory of foliations, we establish the cone theorem and the contraction theorem for lc generalized pairs in full generality, and meanwhile develop the minimal model program for $\mathbb Q$-factorial foliated dlt…
A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the…
A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…
We extend the BFSS matrix theory by means of Lie 3-algebra. The extended model possesses the same supersymmetry as the original BFSS matrix theory, and thus as the infinite momentum frame limit of M-theory. We study dynamics of the model by…
This paper establishes a combinatorial central limit theorem for stratified randomization, which holds under a Lindeberg-type condition. The theorem allows for an arbitrary number or sizes of strata, with the sole requirement being that…
In the first section of this note we show that the Theorem 1.8.1 of Bayer--Manin ([BaMa]) can be strengthened in the following way: {\it if the even quantum cohomology of a projective algebraic manifold $V$ is generically semi--simple, then…
Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log…
A very short proof of the Fej\'er-Riesz lemma is presented in the matrix case
We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…
The MinRank problem is a simple linear algebra problem: given matrices with coefficients in a field, find a non trivial linear combination of the matrices that has a small rank. There are several algebraic modeling of the problem. The main…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…
One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We consider the convex optimization problem $\min \{f(x) : g_j(x)\leq 0, j=1,...,m\}$ where $f$ is convex, the feasible set K is convex and Slater's condition holds, but the functions $g_j$ are not necessarily convex. We show that for any…
The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…
Lifted inference reduces the complexity of inference in relational probabilistic models by identifying groups of constants (or atoms) which behave symmetric to each other. A number of techniques have been proposed in the literature for…
We prove the Landau-Ginzburg mirror symmetry conjecture between invertible quasi-homogeneous polynomial singularities at all genera. That is, we show that the FJRW theory (LG A-model) of such a polynomial is equivalent to the Saito-Givental…