Related papers: Sub-Fibonacci behavior in numerical semigroup enum…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
We show that arithmetic subgroups of semisimple groups of relative Q-type A_n, B_n, C_n, D_n, E_6, or E_7 have an exponential lower bound to their isoperimetric inequality in the dimension that is 1 less than the real rank of the semisimple…
We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…
We examine the ranks of operators in semi-finite C*-algebras as measured by their densely defined lower semicontinuous traces. We first prove that a unital simple C*-algebra whose extreme tracial boundary is nonempty and finite contains…
A set $S$ of vertices in $G$ is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance $2$ of another vertex of $S$. The \emph{semitotal domination number}, $\gamma_{t2}(G)$, is the…
An $(a:b)$-coloring of a graph $G$ is a function $f$ which maps the vertices of $G$ into $b$-element subsets of some set of size $a$ in such a way that $f(u)$ is disjoint from $f(v)$ for every two adjacent vertices $u$ and $v$ in $G$. The…
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…
Let $G$ be a connected algebraic semisimple real Lie group with finite center and no compact factors, and let $\Gamma$ be a Zariski dense discrete subgroup of $G$. We show that $\Gamma$ contains free, finitely generated subsemigroups whose…
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…
We investigate rates of decay for $C_0$-semigroups on Hilbert spaces under assumptions on the resolvent growth of the semigroup generator. Our main results show that one obtains the best possible estimate on the rate of decay, that is to…
A vertex $v$ in a porous exponential dominating set assigns weight $\left(\tfrac{1}{2}\right)^{dist(v,u)}$ to vertex $u$. A porous exponential dominating set of a graph $G$ is a subset of $V(G)$ such that every vertex in $V(G)$ has been…
Let $p_1=2, p_2=3, p_3=5, \ldots$ be the consecutive prime numbers, $S_n$ the numerical semigroup generated by the primes not less than $p_n$ and $u_n$ the largest irredundant generator of $S_n$. We will show, that $\bullet$ $u_n\sim3p_n$.…
We consider symmetric (not complete intersection) numerical semigroups S_5, generated by five elements, and derive inequalities for degrees of syzygies of S_5 and find the lower bound F_5 for their Frobenius numbers. We study a special case…
We consider symmetric (not complete intersection) numerical semigroups S_6, generated by a set of six positive integers {d_1,...,d_6}, gcd(d_1,...,d_6)=1, and derive inequalities for degrees of syzygies of such semigroups and find the lower…
In this article, we first prove that the type of an affine semigroup ring is equal to the number of maximal elements of the Ap\'ery set with respect to the set of exponents of the monomials, which form a maximal regular sequence. Further,…
We introduce a module-theoretic approach and a linear-programming method to compute the matricial dimension of numerical semigroups. We use these to compute the matricial dimension of every numerical semigroup with Frobenius number at most…
A sharp upper bound for the maximum integer not belonging to an ideal of a numerical semigroup is given and the ideals attaining this bound are characterized. Then the result is used, through the so-called Feng-Rao numbers, to bound the…
A semigroup is \emph{nilpotent} of degree 3 if it has a zero, every product of 3 elements equals the zero, and some product of 2 elements is non-zero. It is part of the folklore of semigroup theory that almost all finite semigroups are…
We describe the asymptotic behavior of weighted factorization lengths on numerical semigroups. Our approach is geometric as opposed to analytic, explains the presence of Curry-Schoenberg B-splines as limiting distributions, and provides…
Let a, k, h, c be positive integers and d a non zero integer. Recall that a numerical generalized almost arithmetic semigroup S is a semigroup minimally generated by relatively prime positive integers a, ha + d, ha + 2d, . . . , ha + kd, c,…