Related papers: An illustrated encyclopedia of area relations
In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in…
The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon is proved to be the generic Newton polygon of the twisted $C$-function of the T-adic exponential sum. It gives the…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd characteristic in which $-1$ is not a square. We show that the Fourier extension operator associated with $P$ maps $L^2$ to $L^{r}$ for $r > \frac{32}{9} \approx…
T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is greater than 4. We also answer the analogous question for regular…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
We describe the T-space of central polynomials for both the unitary and the nonunitary infinite dimensional Grassmann algebra over a field of characteristic p not equal to 2 (infinite field in the case of the unitary algebra).
In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
A Taylor variety consists of all fixed order Taylor polynomials of rational functions, where the number of variables and degrees of numerators and denominators are fixed. In one variable, Taylor varieties are given by rank constraints on…
Our main theorem classifies the Auslander-Reiten triangles according to properties of the morphisms involved. As a consequence, we are able to compute the mapping cone of an irreducible morphism. We finish by showing a technique for…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…
We establish several fundamental properties of analysis-suitable T-splines which are important for design and analysis. First, we characterize T-spline spaces and prove that the space of smooth bicubic polynomials, defined over the extended…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
Eulerian polynomials are fundamental in combinatorics and algebra. In this paper we study the linear transformation $\mathcal{A} : \mathbb{R}[t] \to \mathbb{R}[t]$ defined by $\mathcal{A}(t^n) = A_n(t)$, where $A_n(t)$ denotes the $n$-th…
In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes…
We describe the T-space of central polynomials for both the unitary and the nonunitary finite dimensional Grassmann algebra over a field of characteristic p not equal to 2 (infinite field in the case of the unitary algebra).