Searcharxiv⌕ Search

arXiv subjects

Jan Draisma

Publications and source records attributed to Jan Draisma.

At least 37 records · Page 2Linked to original sources

On subtensors of high partition rank

We prove that for every positive integer $d \ge 2$ there exist polynomial functions $F_d, G_d: \mathbb{N} \to \mathbb{N}$ such that for each positive integer $r$, every order-$d$ tensor $T$ over an arbitrary field and with partition rank at least $G_d(r)$ contains a $F_d(r) \times \cdots \times F_d(r)$ subtensor with partition rank at least $r$. We then deduce analogous results on the Schmidt rank of polynomials in zero or high characteristic.

math.CO↗

No short polynomials vanish on bounded rank matrices

We show that the shortest nonzero polynomials vanishing on bounded-rank matrices and skew-symmetric matrices are the determinants and Pfaffians characterising the rank. Algebraically, this means that in the ideal generated by all $t$-minors or $t$-Pfaffians of a generic matrix or skew-symmetric matrix one cannot find any polynomial with fewer terms than those determinants or Pfaffians, respectively, and that those determinants and Pfaffians are essentially the only polynomials in the ideal with that many terms. As a key tool of independent interest, we show that the ideal of a sufficiently general $t$-dimensional subspace of an affine $n$-space does not contain polynomials with fewer than $t+1$ terms.

math.AC↗

Countably many asymptotic tensor ranks

In connection with recent work on gaps in the asymptotic subranks of complex tensors the question arose whether the number of nonnegative real numbers that arise as the asymptotic subrank of some complex tensor is countable. In this short note we settle this question in the affirmative, for all tensor invariants that are algebraic in the sense that they are invariant under field automorphisms of the complex numbers.

math.AG↗

Image closure of symmetric wide-matrix varieties

Let $X$ be an affine scheme of $k \times \mathbb{N}$-matrices and $Y$ be an affine scheme of $\mathbb{N} \times \cdots \times \mathbb{N}$-dimensional tensors. The group Sym$(\mathbb{N})$ acts naturally on both $X$ and $Y$ and on their coordinate rings. We show that the Zariski closure of the image of a Sym$(\mathbb{N})$-equivariant morphism of schemes from $X$ to $Y$ is defined by finitely many Sym$(\mathbb{N})$-orbits in the coordinate ring of $Y$. Moreover, we prove that the closure of the image of this map is Sym$(\mathbb{N})$-Noetherian, that is, every descending chain of Sym$(\mathbb{N})$-stable closed subsets stabilizes.

math.AG↗

The unique coclique extension property for apartments of buildings

We show that the Kneser graph of objects of a fixed type in a building of spherical type has the unique coclique extension property when the corresponding representation has minuscule weight and also when the diagram is simply laced and the representation is adjoint.

math.CO↗

A Tensor Restriction Theorem over Finite Fields

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no infinite strictly decreasing sequences. This result, reminiscent of the graph minor theorem, has important consequences for an arbitrary restriction-closed tensor property $X$. For instance, $X$ admits a characterisation by finitely many forbidden restrictions and can be tested by looking at subtensors of a fixed size. Our proof involves an induction over polynomial generic representations, establishes a generalisation of the tensor restriction theorem to other such representations (e.g. homogeneous polynomials of a fixed degree), and also describes the coarse structure of any restriction-closed property.

math.AG↗

The geometry of polynomial representations

We define a GL-variety to be a (typically infinite dimensional) algebraic variety equipped with an action of the infinite general linear group under which the coordinate ring forms a polynomial representation. Such varieties have been used to study asymptotic properties of invariants like strength and tensor rank, and played a key role in two recent proofs of Stillman's conjecture. We initiate a systematic study of GL-varieties, and establish a number of foundational results about them. For example, we prove a version of Chevalley's theorem on constructible sets in this setting.

math.AG↗

Components of symmetric wide-matrix varieties

We show that if X_n is a variety of cxn-matrices that is stable under the group Sym([n]) of column permutations and if forgetting the last column maps X_n into X_{n-1}, then the number of Sym([n])-orbits on irreducible components of X_n is a quasipolynomial in n for all sufficiently large n. To this end, we introduce the category of affine FI^op-schemes of width one, review existing literature on such schemes, and establish several new structural results about them. In particular, we show that under a shift and a localisation, any width-one FI^op-scheme becomes of product form, where X_n=Y^n for some scheme Y in affine c-space. Furthermore, to any FI^op-scheme of width one we associate a component functor from the category FI of finite sets with injections to the category PF of finite sets with partially defined maps. We present a combinatorial model for these functors and use this model to prove that Sym([n])-orbits of components of X_n, for all n, correspond bijectively to orbits of a groupoid acting on the integral points in certain rational polyhedral cones. Using the orbit-counting lemma for groupoids and theorems on quasipolynomiality of lattice point counts, this yields our Main Theorem.

math.AC↗

On the quadratic equations for odeco tensors

Elina Robeva discovered quadratic equations satisfied by orthogonally decomposable ("odeco") tensors. Boralevi-Draisma-Horobeţ-Robeva then proved that, over the real numbers, these equations characterise odeco tensors. This raises the question to what extent they also characterise the Zariski-closure of the set of odeco tensors over the complex numbers. In the current paper we restrict ourselves to symmetric tensors of order three, i.e., of format $n \times n \times n$. By providing an explicit counterexample to one of Robeva's conjectures, we show that for $n \geq 12$, these equations do not suffice. Furthermore, in the open subset where the linear span of the slices of the tensor contains an invertible matrix, we show that Robeva's equations cut out the limits of odeco tensors for dimension $n \leq 13$, and not for $n \geq 14$ on. To this end, we show that Robeva's equations essentially capture the Gorenstein locus in the Hilbert scheme of $n$ points and we use work by Casnati-Jelisiejew-Notari on the (ir)reducibility of this locus.

math.AG↗

Implicitisation and Parameterisation in Polynomial Functors

In earlier work, the second author showed that a closed subset of a polynomial functor can always be defined by finitely many polynomial equations. In follow-up work on $\operatorname{GL}\nolimits_{\infty}$-varieties, Bik-Draisma-Eggermont-Snowden showed, among other things, that in characteristic zero every such closed subset is the image of a morphism whose domain is the product of a finite-dimensional affine variety and a polynomial functor. In this paper, we show that both results can be made algorithmic: there exists an algorithm $\mathbf{implicitise}$ that takes as input a morphism into a polynomial functor and outputs finitely many equations defining the closure of the image; and an algorithm $\mathbf{parameterise}$ that takes as input a finite set of equations defining a closed subset of a polynomial functor and outputs a morphism whose image is that closed subset.

math.AG↗

Quasihomomorphisms from the integers into Hamming metrics

A function $f: \mathbb{Z} \to \mathbb{Q}^n$ is a $c$-quasihomomorphism if the Hamming distance between $f(x+y)$ and $f(x)+f(y)$ is at most $c$ for all $x,y \in \mathbb{Z}$. We show that any $c$-quasihomomorphism has distance at most some constant $C(c)$ to an actual group homomorphism; here $C(c)$ depends only on $c$ and not on $n$ or $f$. This gives a positive answer to a special case of a question posed by Kazhdan and Ziegler.

math.CO↗

Topological Noetherianity of polynomial functors II: base rings with Noetherian spectrum

In a previous paper, the third author proved that finite-degree polynomial functors over infinite fields are topologically Noetherian. In this paper, we prove that the same holds for polynomial functors from free $R$-modules to finitely generated $R$-modules, for any commutative ring $R$ whose spectrum is Noetherian. As Erman-Sam-Snowden pointed out, when applying this with $R = \mathbb{Z}$ to direct sums of symmetric powers, one of their proofs of a conjecture by Stillman becomes characteristic-independent. Our paper advertises and further develops the beautiful but not so well-known machinery of polynomial laws. In particular, to any finitely generated R-module M we associate a topological space, which we show is Noetherian when $\operatorname{Spec}(R)$ is; this is the degree-zero case of our result on polynomial functors.

math.AC↗

Tropical ideals do not realise all Bergman fans

Every tropical ideal in the sense of Maclagan-Rincón has an associated tropical variety, a finite polyhedral complex equipped with positive integral weights on its maximal cells. This leads to the realisability question, ubiquitous in tropical geometry, of which weighted polyhedral complexes arise in this manner. Using work of Las Vergnas on the non-existence of tensor products of matroids, we prove that there is no tropical ideal whose variety is the Bergman fan of the direct sum of the Vámos matroid and the uniform matroid of rank two on three elements, and in which all maximal cones have weight one.

math.CO↗

Universality of high-strength tensors

A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of variables. Using entirely different techniques, we extend this theorem to arbitrary polynomial functors. As a corollary of our work, we show that specialisation induces a quasi-order on elements in polynomial functors, and that among the elements with a dense orbit there are unique smallest and largest equivalence classes in this quasi-order.

math.AG↗

Catalan-many tropical morphisms to trees; Part I: Constructions

We investigate the tree gonality of a genus-$g$ metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this number is at most $\lceil g/2 \rceil + 1$, a fact whose proofs so far required an algebro-geometric detour via special divisors on curves. For even genus, the tropical morphism which realizes the bound belongs to a family of tropical morphisms that is pure of dimension $3g-3$ and that has a generically finite-to-one map onto the moduli space of genus-$g$ metric graphs. Our methods focus on the study of such families. This is part I in a series of two papers: in part I we fix the combinatorial type of the metric graph, while in part II we vary the combinatorial type and show that the number of tropical morphisms, counted with suitable multiplicities, is the same Catalan number that counts morphisms from a genus-$g$ curve to the projective line.

math.CO↗

The irreducible control property in matrix groups

This paper concerns matrix decompositions in which the factors are restricted to lie in a closed subvariety of a matrix group. Such decompositions are of relevance in control theory: given a target matrix in the group, can it be decomposed as a product of elements in the subvarieties, in a given order? And if so, what can be said about the solution set to this problem? Can an irreducible curve of target matrices be lifted to an irreducible curve of factorisations? We show that under certain conditions, for a sufficiently long and complicated such sequence, the solution set is always irreducible, and we show that every connected matrix group has a sequence of one-parameter subgroups that satisfies these conditions, where the sequence has length less than 1.5 times the dimension of the group.

math.AG↗

Matroids over one-dimensional groups

We develop the theory of matroids over one-dimensional algebraic groups, with special emphasis on positive characteristic. In particular, we compute the Lindström valuations and Frobenius flocks of such matroids. Building on work by Evans and Hrushovski, we show that the class of algebraic matroids, paired with their Lindström valuations, is not closed under duality of valuated matroids.

math.CO↗

The monic rank

We introduce the monic rank of a vector relative to an affine-hyperplane section of an irreducible Zariski-closed affine cone $X$. We show that the monic rank is finite and greater than or equal to the usual $X$-rank. We describe an algorithmic technique based on classical invariant theory to determine, in concrete situations, the maximal monic rank. Using this technique, we establish three new instances of a conjecture due to B. Shapiro which states that a binary form of degree $d\cdot e$ is the sum of $d$ $d$-th powers of forms of degree $e$. Furthermore, in the case where $X$ is the cone of highest weight vectors in an irreducible representation---this includes the well-known cases of tensor rank and symmetric rank---we raise the question whether the maximal rank equals the maximal monic rank. We answer this question affirmatively in several instances.

math.AG↗