Related papers: Factorization length distribution for affine semig…
Categorical random variables are a common staple in machine learning methods and other applications across disciplines. Many times, correlation within categorical predictors exists, and has been noted to have an effect on various algorithm…
We characterize affine semigroups having one Betti element and we compute some relevant non-unique factorization invariants for these semigroups. As an example, we particularize our description to numerical semigroups.
We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…
In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…
An m-endomorphism of a free semigroup is an endomorphism that sends every generator to a word of length at most m. Two m-endomorphisms are combinatorially equivalent if they are conjugate under an automorphism of the semigroup. In this…
We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the…
Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…
This article discusses numerical semigroups having a generator which is as large as possible. This turns out to be $2g+1$, where $g$ is the genus of the semigroup. We will show that these semigroups are closely related to symmetric…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
We prove that for a number field $F$, the distribution of the points of a set $\Sigma \subset \mathbb{A}_F^n$ with a purely exponential parametrization, for example a set of matrices boundedly generated by semi-simple (diagonalizable)…
Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros conjectured that n_g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree.…
We calculate the cluster modular groups of affine and doubly extended typecluster algebras in a uniform way by introducing a new family of quivers. We use this uniformdescription to construct a natural finite quotient of the cluster complex…
We extend \cite{G} to the nonsemisimple case. We define and study exact factorizations $\B=\A\bullet \C$ of a finite tensor category $\B$ into a product of two tensor subcategories $\A,\C\subset \B$, and relate exact factorizations of…
A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. Unfortunately, the resulting submodular optimization…
An atomic monoid is length-factorial if each two distinct factorizations of any element have distinct factorization lengths. We provide a characterization of length-factorial Krull monoids in terms of their class groups and the distribution…
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
A predictive distribution over a sequence of $N+1$ events is said to be "frequency mimicking" whenever the probability for the final event conditioned on the outcome of the first $N$ events equals the relative frequency of successes among…
We establish an equidistribution theorem for the zeros of random holomorphic sections of high powers of a positive holomorphic line bundle. The equidistribution is associated with a family of singular moderate measures. We also give a…
In order to investigate the relationship between weak amenability and the Haagerup property for groups, we introduce the weak Haagerup property, and we prove that having this approximation property is equivalent to the existence of a…
This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.