相关论文: Sufficient conditions for Strassen's additivity co…
We propose a new method, using deformation theory, to study the maximal rank conjecture. For line bundles of extremal degree, which can be viewed as the first case to test the conjecture, we prove that maximal rank conjecture holds by our…
We present a modification of the superposition calculus that is meant to generate explanations why a set of clauses is satisfiable. This process is related to abductive reasoning, and the explanations generated are clauses constructed over…
We provide new sufficient conditions under which Ryser's conjecture holds.
We show that the Waring rank of the $3 \times 3$ determinant, previously known to be between $14$ and $18$, is at least $15$. We use syzygies of the apolar ideal, which have not been used in this way before. Additionally, we show that the…
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
In this paper, we have obtained a necessary and suffcient condition for the series.
The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…
(EN) We revise the famous algorithm for symmetric tensor decomposition due to Brachat, Comon, Mourrain and Tsidgaridas. Afterwards, we generalize it in order to detect possibly different decompositions involving points on the tangential…
Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…
Let p>2 be prime. We complete the proof of the weight part of Serre's conjecture for rank two unitary groups for mod p representations in the totally ramified case, by proving that any weight which occurs is a predicted weight. Our methods…
In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the…
We give positivity conditions on the embedding of a smooth variety which guarantee the normality of the secant variety, generalizing earlier results of the author and others. We also give classes of secant varieties satisfying the Hodge…
In this paper, we analyze the fundamental conditions for low-rank tensor completion given the separation or tensor-train (TT) rank, i.e., ranks of unfoldings. We exploit the algebraic structure of the TT decomposition to obtain the…
We consider Bratteli diagrams of finite rank (not necessarily simple) and ergodic invariant measures with respect to the cofinal equivalence relation on their path spaces. It is shown that every ergodic invariant measure (finite or…
A natural number is a binary $k$'th power if its binary representation consists of $k$ consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary $k$'th powers. More precisely, we show that for each integer $k…
Sommese has conjectured a classification of smooth projective varieties X containing, as an ample divisor, a P^d-bundle Y over a smooth variety Z. This conjecture is known if d>1, if dim(X)<5, or if Z admits a finite morphism to an Abelian…
Abstract argumentation offers an appealing way of representing and evaluating arguments and counterarguments. This approach can be enhanced by a probability assignment to each argument. There are various interpretations that can be ascribed…
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…
The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…
In this paper, we use the idempotent decomposition to give an explicit isomorphism from an arbitrary semisimple Artinian ring to an external direct sum of finitely many full matrix rings over division rings.