相关论文: Characteristic quasi-polynomials of ideals and sig…

The Tutte polynomial is originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning subgraphs, and of…

We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…

Let $q$ be a positive integer. In our recent paper, we proved that the cardinality of the complement of an integral arrangement, after the modulo $q$ reduction, is a quasi-polynomial of $q$, which we call the characteristic…

Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…

After sketching the basic theory of injective ideals of homogeneous polynomials, we characterize injective polynomial ideals by means of a domination property and applications of this characterization to some classical operator ideals and…

Let $\mathcal{A}$ be a Weyl arrangement. We introduce and study the notion of $\mathcal{A}$-Eulerian polynomial producing an Eulerian-like polynomial for any subarrangement of $\mathcal{A}$. This polynomial together with shift operator…

In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…

We characterize characteristic polynomials of elements in a central simple algebra. We also give an account for the theory of rational canonical forms for separable linear transformations over a central division algebra, and a description…

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

We introduce and study a special class of ideals, called tropical ideals, in the semiring of tropical polynomials, with the goal of developing a useful and solid algebraic foundation for tropical geometry. The class of tropical ideals…

We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…

A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

We introduce a partition of (coweight) lattice points inside the dilated fundamental parallelepiped into those of partially closed simplices. This partition can be considered as a generalization and a lattice points interpretation of the…