Related papers: Asymptotic Degree of Random Monomial Ideals
We study the properties of the giant connected component in random graphs with arbitrary degree distribution. We concentrate on the degree-degree correlations. We show that the adjoining nodes in the giant connected component are correlated…
For physical theories, the degree of arbitrariness of a system is of great importance, and is often closely linked to the concept of degree of freedom, and for most systems this number is far from obvious. In this paper we present an easy…
Symmetric ideals in increasingly larger polynomial rings that form an ascending chain are investigated. We focus on the asymptotic behavior of codimensions and projective dimensions of ideals in such a chain. If the ideals are graded it is…
We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…
The supremum of reduction numbers of ideals having principal reductions is expressed in terms of the integral degree, a new invariant of the ring, which is finite provided the ring has finite integral closure. As a consequence, one obtains…
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…
Given a factor code $\pi$ from a one-dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$, if $\pi$ is finite-to-one there is an invariant called the degree of $\pi$ which is defined the number of preimages of a typical…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
We show that the dynamical degree of an (i.i.d) random sequence of dominant, rational self-maps on projective space is almost surely constant. We then apply this result to height growth and height counting problems in random orbits.
We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…
We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…
We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…
We study a new biholomorphic invariant of holomorphic maps between domains in different dimensions based on generic initial ideals. We start with the standard generic monomial ideals to find invariants for rational maps of spheres and…
We introduce a two-parameter modification of the cofinality invariant of ideals. This allows us to include the interaction of a pair of ideals in the study of base-like structures. We find the values (cardinal numbers or well-known cardinal…
Continuing a well established tradition of associating convex bodies to monomial ideals, we initiate a program to construct asymptotic Newton polyhedra from decompositions of monomial ideals. This is achieved by forming a graded family of…
Rational homology ellipsoids are certain Liouville domains diffeomorphic to rational homology balls and having Lagrangian pin-wheels as their skeleta. From the point of view of almost toric fibrations, they are a natural generalisation of…
We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…
Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…
We propose a semiparametric model for dyadic link formations in directed networks. The model contains a set of degree parameters that measure different effects of popularity or outgoingness across nodes, a regression parameter vector that…