Related papers: Combinatorial Differential Algebra of $x^p$

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are…

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

We consider the action of the projective group $PGL(3,\mathbb{R})$ on the $n$-fold first-order jet space of point configurations on the plane. Using the method of moving frames, we construct an explicit complete generating set for the field…

A major unsolved problem (according to Demailly 1997) towards the Kobayashi hyperbolicity conjecture in optimal degree is to understand jet differentials of germs of holomorphic discs that are invariant under any reparametrization of the…

We prove the following finite jet determination result for CR mappings: Given a smooth generic submanifold M of C^N, N >= 2, which is essentially finite and of finite type at each of its points, for every point p on M there exists an…

The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…

The symmetric coinvariant algebra $C[x_1, dots, x_n]_{S_n}$ is the quotient algebra of the polynomial ring by the ideal generated by symmetric polynomials vanishing at the origin. It is known that the algebra is isomorphic to the regular…

In differential geometry, the notation d^n f along with the corresponding formalism has fallen into disuse since the birth of exterior calculus. However, differentials of higher order are useful objects that can be interpreted in terms of…

The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are methods to enumerate perfect matchings of plane graphs that was discovered by P. W. Kasteleyn. We present several new techniques and arguments related…

We show that the iterated images of a Jacobian pair stabilize; that is, the k-th iterates of a polynomial map of complex two-space to itself with a nonzero constant Jacobian determinant all have the same image for sufficiently large k. More…

We show that for all $k\ge 1$, there exists an integer $N(k)$ such that for all $n\ge N(k)$ the $k$-th order jet scheme over the commuting $n\times n$ matrix pairs scheme is reducible. At the other end of the spectrum, it is known that for…

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. We say a subset of…

We consider the affine variety ${\mathcal{Z}_{2,2}^{m,n}}$ (or just "$Y$") of first order jets over ${\mathcal{Z}_{2}^{m,n}}$ (or just "$X$"), where $X$ is the classical determinantal variety given by the vanishing of all $2\times 2$ minors…

In this paper, we study a family of binomial ideals defining monomial curves in the $n-$dimensional affine space determined by $n$ hypersurfaces of the form $x_i^{c_i} - x_1^{u_{i1}} \cdots x_n^{u_{1n}} \in k[x_1, \ldots, x_n]$ with $u_{ii}…

This article studies the scheme structure of the jet schemes of determinantal varieties. We show that in general, these jet schemes are not irreducible. In the case of the determinantal variety $X$ of $r \times s$ matrices of rank at most…

We introduce a cotwist construction for Hopf algebroids that also entails cotwisting or `quantisation' of the base and which is dual to a previous twisting construction of P. Xu. Whereas the latter applied the construction to the algebra of…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this…