相关论文: Improved bounds on the number of numerical semigro…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
The main results in this thesis deal with the representation growth of certain classes of groups. In chapter $1$ we present the required preliminary theory. In chapter $2$ we introduce the Congruence Subgroup Problem for an algebraic group…
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…
The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…
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…
We give lower bounds on the number of effective divisors of degree $\leq g-1$ with respect to the number of places of certain degrees of an algebraic function field of genus $g$ defined over a finite field. We deduce lower bounds and…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…
In this paper, we bring the terminology of the Kunz coordinates of numerical semigroups to gapsets and we generalize this concept to $m$-extensions. It allows us to identify gapsets and, in general, $m$-extensions with tilings of boards. As…
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…
The enumeration of zero-sum subsequences of a given sequence over finite cyclic groups is one classical topic, which starts from one question of P. Erd\H{o}s. In this paper, we consider this problem in a more general setting -- finite…
Let $\mathfrak{g}$ be a semisimple complex Lie algebra of finite dimension and $\mathfrak{h}$ be a semisimple subalgebra. We present an approach to find the branching rules for the pair $\mathfrak{g}\supset\mathfrak{h}$. According to an…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
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…
Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.
The purpose of this paper is to revisit the proof of the Gearhart-Pr\"uss-Huang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on the…
Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…
We show that the minimal number of generators and the Cohen-Macaulay type of a family of numerical semigroups generated by concatenation of arithmetic sequences is unbounded.
Generative models reliant on sequential autoregression have been at the forefront of language generation for an extensive period, particularly following the introduction of widely acclaimed transformers. Despite its excellent performance,…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…