Searcharxiv⌕ Search

arXiv subjects

Weronika Buczyńska

Publications and source records attributed to Weronika Buczyńska.

13 recordsLinked to original sources
arXiv2026

Apolarity for border cactus decompositions

The border apolarity technique was introduced in our earlier work for secant varieties over complex numbers. We extend the theory to cactus varieties of toric varieties over any algebraically closed field. A border cactus decomposition is a mulithomogeneous ideal in the Cox ring (also called the total coordinate ring) of the toric variety that witnesses that a given point is in a specific cactus variety. The definition of such witness uses apolarity and we describe the set of ideals that are credible witnesses for this purpose in terms of a correspondence between the usual Hilbert scheme (parametrising all closed subschemes of the toric variety) and the multigraded Hilbert scheme (parametrising all multihomogeneous ideals in the Cox ring). We also take this opportunity to extend the border apolarity to linear subspaces (in non-border setting, this is equivalent to simultaneous decompositions).

math.AG↗
arXiv2025

Grassmann cactus variety and socle dimension

Grassmann cactus variety is a common generalisation of Grassmann secant variety and cactus variety. In their definitions one considers the vector spaces of fixed dimension that are contained in the linear span of some finite schemes. We prove that to characterise Grassmann cactus varieties it is enough to use finite schemes that locally have low socle dimension. This motivates the study of parameter spaces of such schemes and simplifies calculations of examples of Grassmann cactus varieties.

math.AG↗
arXiv2024

Cactus varieties of sufficiently ample embeddings of projective schemes have determinantal equations

For a fixed projective scheme X, a property P of line bundles is satisfied by sufficiently ample line bundles if there exists a line bundle L_0 on X such that P(L) holds for any L with (L - L_0) ample. As an example, sufficiently ample line bundles are very ample, moreover, for a normal variety X, the embedding corresponding to sufficiently ample line bundle is projectively normal. The grandfather of such properties and a basic ingredient used to study this concept is Fujita vanishing theorem, which is a strengthening of Serre vanishing to sufficiently ample line bundles. The r-th cactus variety of X is an analogue of secant variety and it is defined using linear spans of finite schemes of degree r. In this article we show that cactus varieties of sufficiently ample embeddings of X are set-theoretically defined by minors of matrices with linear entries. The topic is closely related to conjectures of Eisenbud-Koh-Stillman, which was proved by Ginensky in the case X a smooth curve. On the other hand Sidman-Smith proved that the ideal of sufficiently ample embedding of any projective scheme X is generated by 2 x 2 minors of a matrix with linear entries.

math.AG↗
arXiv2020

Apolarity, border rank and multigraded Hilbert scheme

We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a systematic approach. We also define a border rank version of the variety of sums of powers and analyse its usefulness in studying tensors and polynomials with large symmetries. In particular, it can be applied to provide lower bounds for the border rank of some very interesting tensors, such as the matrix multiplication tensor. We work in a general setting, where the base variety is not necessarily a Segre or Veronese variety, but an arbitrary smooth toric projective variety. A critical ingredient of our work is an irreducible component of a multigraded Hilbert scheme related to the toric variety in question.

math.AG↗
arXiv2018

The Hackbusch conjecture on tensor formats - part two

We prove a conjecture of W.~Hackbusch in a bigger generality than in our previous article. Here we consider Tensor Train (TT) model with an arbitrary number of leaves and a corresponding "almost binary tree" for Hierarchical Tucker (HT) model, i.e. the deepest tree with the same number of leaves. Our main result is an algorithm that computes the flattening rank of a generic tensor in a Tensor Network State (TNS) model on a given tree with respect to any flattening coming from combinatorics of the space. The methods also imply that the tensor rank (which is also called CP-rank) of most tensors in a TNS model grows exponentially with the growth of the number of leaves for any shape of the tree.

math.CO↗
arXiv2015

Hackbusch Conjecture on tensor formats

We prove a conjecture of W. Hackbusch about tensor network states related to a perfect binary tree and train track tree. Tensor network states are used to present seemingly complicated tensors in a relatively simple and efficient manner. Each such presentation is described by a binary tree and a collection of vector spaces, one for each vertex of the tree. A problem suggested by Wolfgang Hackbusch and Joseph Landsberg is to compare the complexities of encodings, if one presents the same tensor with respect to two different trees. We answer this question when the two trees are extremal cases: the most "spread" tree (perfect binary tree), and the "deepest" binary tree (train track tree). The corresponding tensor formats are called hierarchical formats (HF) and tensor train (TT) formats, respectively.

math.AG↗
arXiv2015

Apolarity and direct sum decomposability of polynomials

A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct sum, in terms of the apolar ideal of the polynomial. We prove that the apolar ideal of a polynomial of degree $d$ strictly depending on all variables has a minimal generator of degree $d$ if and only if it is a limit of direct sums.

math.AG↗
arXiv2014

On differences between the border rank and the smoothable rank of a polynomial

We consider higher secant varieties to Veronese varieties. Most points on the r-th secant variety are represented by a finite scheme of length r contained in the Veronese variety --- in fact, for generic point, it is just a union of r distinct points. A modern way to phrase it is: the smoothable rank is equal to the border rank for most polynomials. This property is very useful for studying secant varieties, especially, whenever the smoothable rank is equal to the border rank for all points of the secant variety in question. In this note we investigate those special points for which the smoothable rank is not equal to the border rank. In particular, we show an explicit example of a cubic in five variables with border rank 5 and smoothable rank 6. We also prove that all cubics in at most four variables have the smoothable rank equal to the border rank.

math.AG↗
arXiv2013

Waring decompositions of monomials

A Waring decomposition of a polynomial is an expression of the polynomial as a sum of powers of linear forms, where the number of summands is minimal possible. We prove that any Waring decomposition of a monomial is obtained from a complete intersection ideal, determine the dimension of the set of Waring decompositions, and give the conditions under which the Waring decomposition is unique up to scaling the variables.

math.AG↗
arXiv2012

On the graph labellings arising from phylogenetics

We study semigroups of labellings associated to a graph. These generalize the Jukes-Cantor model and phylogenetic toric varieties defined by Buczyńska. Our main theorem bounds the degree of the generators of the semigroup by g+1 when the graph has first Betti number g. Also, we provide a series of examples where the bound is sharp.

math.CO↗
arXiv2011

Secant varieties to high degree Veronese reembeddings, catalecticant matrices and smoothable Gorenstein schemes

We study the secant varieties of the Veronese varieties and of Veronese reembeddings of a smooth projective variety. We give some conditions, under which these secant varieties are set-theoretically cut out by determinantal equations. More precisely, they are given by minors of a catalecticant matrix. These conditions include the case when the dimension of the projective variety is at most 3 and the degree of reembedding is sufficiently high. This gives a positive answer to a set-theoretic version of a question of Eisenbud in dimension at most 3. For dimension four and higher we produce plenty of examples when the catalecticant minors are not enough to set-theoretically define the secant varieties to high degree Veronese varieties. This is done by relating the problem to smoothability of certain zero-dimensional Gorenstein schemes.

math.AG↗
arXiv2010

Phylogenetic toric varieties on graphs

We define phylogenetic projective toric model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. Generators of the pro- jective coordinate ring of the models of graphs with one cycle are explicitly described. The phylogenetic models of graphs with the same topological invariants are deforma- tion equivalent and share the same Hilbert function. We also provide an algorithm to compute the Hilbert function.

math.AG↗