Related papers: Random numerical semigroups and a simplicial compl…
In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…
We give a criterion for almost Gorenstein property for semigroup rings associated with simplicial semigroups. We extend Nari's theorem for almost symmetric numerical semigroups to simplicial semigroups with higher rank. By this criterion,…
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
We describe a probability distribution on isomorphism classes of principally quasi-polarized p-divisible groups over a finite field k of characteristic p which can reasonably be thought of as "uniform distribution," and we compute the…
Let $G$ be a higher rank semisimple linear algebraic group over a non-Archimedean local field. The simplicial complexes corresponding to any sequence of pairwise non-conjugate irreducible lattices in $G$ are Benjamini-Schramm convergent to…
We associate to any irreducible germ S of complex quasi-ordinary hypersurface an analytically invariant semigroup. We deduce a direct proof (without passing through their embedded topological invariance) of the analytical invariance of the…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…
In this paper we study those submonoids of $\mathbb{N}^d$ which a non-trivial pseudo-Frobenius set. In the affine case, we prove that they are the affine semigroups whose associated algebra over a field has maximal projective dimension…
Consider a numerical semigroup minimally generated by a subset of the interval $[e,2e-1]$ with multiplicity $e$ and width $e-1$. Such numerical semigroups are called Sally type semigroups. We show that the defining ideals of these semigroup…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
Judith Sally proved in 1980 that the associated graded ring of one-dimensional Gorenstein local rings of multiplicity $e$ and embedding dimension $e-2$ are Cohen-Macaulay. She showed that the defining ideal of the associated graded ring of…
We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…
Let $S$ be a numerical semigroup. We will say that $h\in {\mathbb{N}} \backslash S$ is an {\it isolated gap }of $S$ if $\{h-1,h+1\}\subseteq S.$ A numerical semigroup without isolated gaps is called perfect numerical semigroup. Denote by…
The Vapnik-Chervonenkis dimension (in short, VC-dimension) of a graph is defined as the VC-dimension of the set system induced by the neighborhoods of its vertices. We show that every $n$-vertex graph with bounded VC-dimension contains a…
For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…