Related papers: Fixed-parameter tractability of canonical polyadic…

Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6^r.r!).poly(n)$, where n=|X|. The novelty of this approach is…

We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over finite fields of any characteristic and any large enough cardinality depending on the analytic rank. Moreover, we show that a plausible…

In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite fields and we establish new asymptotical and not asymptotical upper bounds about it.

Motivated by a flurry of recent work on efficient tensor decomposition algorithms, we show that the celebrated moment matrix extension algorithm of Brachat, Comon, Mourrain, and Tsigaridas for symmetric tensor canonical polyadic (CP)…

We give necessary and sufficient conditions for unirationality and rationality of Fano threefolds of geometric Picard rank-1 over an arbitrary field of zero characteristic.

Let $A$ be a unital locally matrix algebra. Among the examples of such algebras are: (1) an infinite tensor product $\otimes M_{n_i}(\mathbb{F})$ of matrix algebras over a field $\mathbb{F}$, and (2) the Clifford algebra of a nondegenerate…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

In this paper we will give a unified proof of several results on the sovability of systems of certain equations over finite fields, which were recently obtained by Fourier analytic methods. Roughly speaking, we show that almost all systems…

We continue our earlier investigation of dp-finite fields. We show that the "heavy sets" of [6] are exactly the sets of full dp-rank. As a consequence, full dp-rank is a definable property in definable families of sets. If $I$ is the group…

We give a characterizations of Ramsey ultrafilters on $\mathscr P(\omega)$ in terms of functions $f:\omega^n\to\omega$ and their ultrafilter extensions. To do this, we prove that for any partition $\mathcal P$ of $[\omega]^n$ there is a…

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic…

We prove that a geometrically integral smooth 3-fold $X$ with nef anti-canonical class and negative Kodaira dimension over a finite field $\mathbb{F}_q$ of characteristic $p>5$ and cardinality $q=p^e > 19$ has a rational point.…

A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

Given an undirected graph $G$, a collection $\{(s_1,t_1),..., (s_k,t_k)\}$ of pairs of vertices, and an integer $p$, the Edge Multicut problem ask if there is a set $S$ of at most $p$ edges such that the removal of $S$ disconnects every…

Let $f: \mathbb{A}^2 \to \mathbb{A}^2$ be a polynomial automorphism of dynamical degree $\delta \geq 2$ over a number field $K$. (This is equivalent to say that $f$ is a polynomial automorphism that is not triangularizable.) Then we…

In this paper, we consider the rank-one tensor completion problem. We address the question of existence and uniqueness of the rank-one solution. In particular we show that the global uniqueness over the field of real numbers can be verified…