Related papers: Asymptotic Degree of Random Monomial Ideals
Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…
Recently, chains of increasing symmetric ideals have attracted considerable attention. In this note, we summarize some results and open problems concerning the asymptotic behavior of several algebraic and homological invariants along such…
We consider a plane polynomial vector field $P(x,y)dx+Q(x,y)dy$ of degree $m>1$. To each algebraic invariant curve of such a field we associate a compact Riemann surface with the meromorphic differential $\omega=dx/P=dy/Q$. The asymptotic…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
Let $I$ be a polymatroidal ideal. In this paper, we study the asymptotic behavior of the homological shift ideals of powers of polymatroidal ideals. We prove that the first homological shift algebra $\text{HS}_1(\mathcal{R}(I))$ of $I$ is…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We explore connections between the generalized multiplicities of square-free monomial ideals and the combinatorial structure of the underlying hypergraphs using methods of commutative algebra and polyhedral geometry. For instance, we show…
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…
In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…
We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the spectral radius of the graph's adjacency matrix, the…
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it…
Let $\mathbb{K}$ be a field and $R = \mathbb{K}[x_1, \ldots, x_n]$. We obtain an improved upper bound for asymptotic resurgence of squarefree monomial ideals in $R$. We study the effect on the resurgence when sum, product and intersection…
In this paper, we study arbitrary (not necessarily associative) 3-dimensional algebras. Such an algebra A is determined by a basis and the corresponding multiplication table, which is specified by 27 structure constants. We describe all…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
This paper deals with random walks on isometry groups of Gromov hyperbolic spaces, and more precisely with the dimension of the harmonic measure $\nu$ associated with such a random walk. We first establish a link of the form $\dim \nu \leq…
Generalised degrees provide a natural bridge between local and global topological properties of networks. We define the generalised degree to be the number of neighbours of a node within one and two steps respectively. Tailored random graph…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…