English
Related papers

Related papers: On certain spaces of lattice diagram determinants

200 papers

Let $\mathcal D_{d,k}$ denote the discriminant variety of degree $d$ polynomials in one variable with at least one of its roots being of multiplicity $\geq k$. We prove that the tangent cones to $\mathcal D_{d,k}$ span $\mathcal D_{d,k-1}$…

Algebraic Geometry · Mathematics 2007-05-23 Gabriel Katz

The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…

Combinatorics · Mathematics 2025-08-29 Anouk E. Brose , Jesús A. De Loera , Gyivan Lopez-Campos , Antonio J. Torres

In this paper, we study polynomial-like elements in vector spaces equipped with group actions. We first define these elements via iterated difference operators. In the case of a full rank lattice acting on an Euclidean space, these…

Analysis of PDEs · Mathematics 2018-08-13 Minh Kha , Vladimir Lin

We consider minimal graphs u(x,y)>0 over unbounded domains D (with u vanishing on the boundary of D). Assuming D contains a sector properly containing a halfplane, we obtain estimates on growth and provide examples illustrating a range of…

Analysis of PDEs · Mathematics 2013-11-15 Erik Lundberg , Allen Weitsman

We will describe solvable lattice models whose partition functions depend on two sets of variables, $x_1,\cdots,x_n$ and $y_1, y_2, \cdots $ that have different connections with the representation theory of $\text{GL}(n,F)$ where $F$ is a…

Representation Theory · Mathematics 2025-09-23 Ben Brubaker , Daniel Bump , Andrew Hardt , Hunter Spink

According to the G\"ottsche conjecture (now a theorem), the degree N^{d, delta} of the Severi variety of plane curves of degree d with delta nodes is given by a polynomial in d, provided d is large enough. These "node polynomials"…

Algebraic Geometry · Mathematics 2011-03-10 Florian Block

Let $\Delta$ be a numerical semigroup and let $d\ge 2$ be an integer. We study the fiber of the quotient map \(S\mapsto S/d\) over $\Delta$. We describe its elements as semigroups of the form $\langle X\rangle+d\Delta$, for suitable finite…

Commutative Algebra · Mathematics 2026-05-15 Ignacio Ojeda , José Carlos Rosales

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

Functional Analysis · Mathematics 2022-02-03 Radu Balan , Kasso A. Okoudjou , Michael Rawson , Yang Wang , Rui Zhang

A higher dimensional lattice space can be decomposed into a number of four-dimensional lattices called as layers. The higher dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer…

High Energy Physics - Lattice · Physics 2009-11-10 M. Murata , H. So

In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…

Representation Theory · Mathematics 2013-10-16 Ian M. Musson

In this article we perform a computational study of Polyrakis algorithms presented in [12,13]. These algorithms are used for the determination of the vector sublattice and the minimal lattice-subspace generated by a finite set of positive…

Computational Finance · Quantitative Finance 2010-06-22 V. N. Katsikis , I. A. Polyrakis

We derive an explicit formula, valid for all integers $r,d\ge 0$, for the dimension of the vector space $C^r_d(\Delta)$ of piecewise polynomial functions continuously differentiable to order $r$ and whose constituents have degree at most…

Commutative Algebra · Mathematics 2023-06-30 Michael DiPasquale , Beihui Yuan

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…

Number Theory · Mathematics 2013-04-30 Fabrizio Barroero , Martin Widmer

We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is…

Optimization and Control · Mathematics 2021-10-28 Shmuel Onn

When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the…

Symbolic Computation · Computer Science 2015-02-16 Ye Liang

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

Combinatorics · Mathematics 2017-03-17 Roy Meshulam

The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…

History and Overview · Mathematics 2025-10-08 Giovanni Longobardi

Given the equations of the first and the second order surfaces in multidimensional space, our goal is to construct a univariate polynomial one of the zeros of which coincides with the square of the distance between these surfaces. To…

Symbolic Computation · Computer Science 2012-07-11 Alexei Yu. Uteshev , Marina V. Yashina

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

Analysis of PDEs · Mathematics 2024-06-19 Francesco Nobili , Matteo Novaga

The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…

Information Theory · Computer Science 2012-05-03 Shengtian Yang , Thomas Honold