Related papers: Bounding invariants of fat points using a coding t…

The SHGH conjecture proposes a solution to the question of how many conditions a general union of fat points imposes on the complete linear system of curves in $\mathbb P^2$ of fixed degree $d$, and it is known to be true in many cases. We…

We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant…

By defining a fat point subscheme of $P^2$ to be a 0-dimensional subscheme defined by a sheaf of integrally closed ideals one extends the notion of fat point subschemes to allow infinitely near points. With this notion of fat points, this…

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

The fat-shattering dimension characterizes the uniform convergence property of real-valued functions. The state-of-the-art upper bounds feature a multiplicative squared logarithmic factor on the sample complexity, leaving an open gap with…

A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…

We give an algorithmic and lower-bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds. It can be applied to intersection graphs of similarly-sized fat objects, yielding…

We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…

We address the problem to determine the limit of the collision of fat points in $\mathbb{P}^n. We give a description of the limit scheme in many cases, in particular in low dimension and multiplicities. The problem turns out to be closely…

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…

We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…

Finding tight bounds on the optimal solution is a critical element of practical solution methods for discrete optimization problems. In the last decade, decision diagrams (DDs) have brought a new perspective on obtaining upper and lower…

We address the problem of bounding from below the self-intersection of integral curves on the projective plane blown-up at general points. In particular, by applying classical deformation theory we obtain the expected bound in the case of…

We consider the problem of maintaining an approximate maximum independent set of geometric objects under insertions and deletions. We present data structures that maintain a constant-factor approximate maximum independent set for broad…

We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…

Let Z be a fat point scheme in P^2 supported on general points. Here we prove that if the multiplicities are at most 3 and the length of Z is sufficiently high then the number of generators of the homogeneous ideal I_Z in each degree is as…

We discuss a geometrical interpretation of the Z-invariant Ising model in terms of isoradial embeddings of planar lattices. The Z-invariant Ising model can be defined on an arbitrary planar lattice if and only if certain paths on the…

It is shown that the standard mod-$p$ valued intersection form can be used to define Boltzmann weights of subdivision invariant lattice models with gauge group $Z_{p}$. In particular, we discuss a four dimensional model which is based upon…