Related papers: Dimension of linear systems: a combinatorial and d…

The main goal of this paper is to present an algorithm bounding the dimension of a linear system of curves of given degree (or monomial basis) with multiple points in general position. As a result we prove the Hirschowitz--Harbourne…

Alexander and Hirschowitz determined the Hilbert function of a generic union of fat points in a projective space when the number of fat points is much bigger than the greatest multiplicity of the fat points. Their method is based on a lemma…

We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…

In this paper we derive estimates for linear potentials that hold away from thin subsets. And, inspired by the celebrated work of Huber, we verify that, for a subset that is thin at a point, there is always a geodesic that reaches to the…

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

In this paper, we consider singular systems of linear forms over global function fields of class number one and give an upper bound for the Hausdorff dimension of the set of singular systems of linear forms by constructing an appropriate…

We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections…

We give a closed formula for the dimension of all linear systems in $\mathbb{P}^n$ with assigned multiplicity at arbitrary collections of points lying on a rational normal curve of degree $n$. In particular we give a purely geometric…

A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…

In this paper we develop techniques for determining the dimension of linear systems of divisors based at a collection of general fat points in P^n by partitioning the monomial basis for the vector space of global sections of O(d). The…

In this paper we prove a conjecture on the dimension of linear systems, with base points of multiplicity 2 and 3, on an Hirzebruck surface.

Singular systems of linear forms were introduced by Khintchine in the 1920s, and it was shown by Dani in the 1980s that they are in one-to-one correspondence with certain divergent orbits of one- parameter diagonal groups on the space of…

This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified…

The linearizability of differential equations was first considered by Lie for scalar second order semi-linear ordinary differential equations. Since then there has been considerable work done on the algebraic classification of linearizable…

Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…

We calculate the maximal dimension of linear spaces of symmetric and hermitian matrices with given high rank, generalizing a well-known result of Adams {\em et al.}

Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…

Wilson lines, being comparators that render non-local operator products gauge invariant, are extensively used in QCD calculations, especially in small-$x$ calculations, calculations concerning validation of factorisation schemes and in…

We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…