相关论文: Counting monomials
We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…
We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.
In this paper, we enumerate enumeration problems and algorithms. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
In this paper we study monomial multiple structures on a linear subspace of codimension two in projective space. We show that these structures determine smooth points in their respective Hilbert schemes, with (smooth) neighbourhoods of two…
The First Hilbert problem is studied in this paper by applying two instruments: a new methodology distinguishing between mathematical objects and mathematical languages used to describe these objects; and a new numeral system allowing one…
We establish an L^2 \times L^2 to L^1 estimate for the bilinear Hilbert transform along a curve defined by a monomial. Our proof is closely related to multi-linear oscillatory integrals.
We propose a numerical method, based upon matrix-pencils, for the identification of parameters and coefficients of a monomial-exponential sum. We note that this method can be considered an extension of the numerical methods for the…
This paper is devoted to finding moments of double exponential sums with monomials over arbitrary sets and intervals in finite fields. The study of such sums dates back to the work of Heath-Brown, who studied such sums in a work on least…
Domineering is a two player game played on a checkerboard in which one player places dominoes vertically and the other places them horizontally. We give bivariate generating polynomials enumerating Domineering positions by the number of…
A solution is given to the following problem: how to compute the multiplicity, or more generally the Hilbert function, at a point on a Schubert variety in an orthogonal Grassmannian. Standard monomial theory is applied to translate the…
We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…
We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.
This article addresses the problem of enumerating the tilings of a plane by lozenges, under the restriction that these tilings be doubly periodic. Kasteleyn's Pfaffian method is applied to compute the generating function of those…
We construct explicit representations of the Heisenberg-Weyl algebra [P,M]=1 in terms of ladder operators acting in the space of Sheffer-type polynomials. Thus we establish a link between the monomiality principle and the umbral calculus.…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
For any partition of a positive integer we consider the chess (or draughts) colouring of its associated Ferrers graph. Let b denote the total number of black unit squares, and w the number of white squares. In this note we characterize all…
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…