相关论文: Residue formulae for vector partitions and Euler-M…

We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…

A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…

We set out an elementary approach to derive Visible Point Identities summed on lattice points of inverted triangle (2D), pyramid (3D), hyperpyramid (4D, 5D and so on) utilizing the greatest common divisor for the nD Visible Point Vectors.…

A {\it vector space partition} is here a collection $\mathcal P$ of subspaces of a finite vector space $V(n,q)$, of dimension $n$ over a finite field with $q$ elements, with the property that every non zero vector is contained in a unique…

All rational parametric curves with prescribed polynomial tangent direction form a vector space. Via tangent directions with rational norm, this includes the important case of rational Pythagorean hodograph curves. We study vector subspaces…

The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…

Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…

This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics, and have immediate applications in…

We introduce a collection of convex polytopes associated to a torus-equivariant vector bundle on a smooth complete toric variety. We show that the lattice points in these polytopes correspond to generators for the space of global sections…

We consider the class of multiple Fourier series associated with functions in the Dirichlet space of the polydisc. We prove that every such series is summable with respect to unrestricted rectangular partial sums, everywhere except for a…

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…

The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…