Related papers: Factorization length distribution for affine semig…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…
For any near-threshold asymptotic regime and for any Feynman diagram (involving loop and/or phase space integrals), a systematic prescription for explicitly constructing all-logs, all-powers (all-twists) expansions in perfectly factorized…
This paper examines the coefficient problems for the class of semigroup generators, a topic in complex dynamics that has recently been studied in context of geometric function theory. Further, sharp bounds of coefficient functional such as…
Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
Let $(X,\bullet )$ be a groupoid (binary algebra) and $Bin(X\dot{)}$ denote the collection of all groupoids defined on $X$. We introduce two methods of factorization for this binary system under the binary groupoid product \textquotedblleft…
The extended weight semigroup of a homogeneous space G/H of a connected semisimple algebraic group G characterizes the spectra of the representations of G on the spaces of regular sections of homogeneous linear bundles over G/H, including…
In every dimension $n\ge 3$ we introduce a class of orthogonal graph-manifolds and prove that the fundamental group of any orthogonal graph-manifold quasi-isometrically embeds into a product of $n$ trees. As a consequence, we obtain that…
In this paper we study numerical semigroups containing a given positive integer and closed with respect to the action of an affine map. For such semigroups we find a minimal set of generators, their embedding dimension, their genus and…
In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…
We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…
In this paper we will give a similar factorization as in \cite{4}, \cite{5}, where the autors Svrtan and Meljanac examined certain matrix factorizations on Fock-like representation of a multiparametric quon algebra on the free associative…
In this short note, we are interested in discussing characteristics of finite generating sets for $\mathcal{F}$, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi…
We present a strategy for computing asymptotics of coefficients of $d$-variate algebraic generating functions. Using known constructions, we embed the coefficient array into an array represented by a rational generating functions in $d+1$…
In this paper we introduce the new concepts of supersymmetric and self-symmetric gaps of a numerical semigroup with two generators. Those concepts are based on certain symmetries of the gaps of the semigroup with respect to their Wilf…
We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…
We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…
A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…
This is the first one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple linear groups.
The main goal of this note is to prove a coarse analogue of Factorization Theorems in Dimension Theory: Let $f: X \rightarrow Y$ be a coarsely continuous map. Then $f$ factors through coarsely continuous maps $g : X \rightarrow Z$ and $h :…