Related papers: Gram-Schmidt-Vaserstein generators for odd sized e…

Generators of Markov processes on a countable state space can be represented as finite or infinite matrices. One key property is that the off-diagonal entries corresponding to jump rates of the Markov process are non-negative. Here we…

We study the infinitesimal generators of evolutions of linear mappings on the space of polynomials, which correspond to a special class of Markov processes with polynomial regressions called quadratic harnesses. We relate the infinitesimal…

Explicit minimal generators for Fulton's Schubert determinantal ideals are determined along with some implications.

Shift registers/Primitive polynomials find applications in various branches of Mathematics, Coding Theory and Cryptography. Matrix analogues of primitive polynomials do exist. In this paper, an algorithmic approach to generating all such…

Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been…

The recently developed theory of extended generating functions of symplectic maps are combined with methods to prove invertibility via high-order Taylor model methods to obtain rigorous lower bounds for the domains of definition of…

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…

We say that a subset $X$ quasi-isometrically boundedly generates a finitely generated group $\Gamma$ if each element $\gamma$ of a finite-index subgroup of $\Gamma$ can be written as a product $\gamma = x_1 x_2 \cdots x_r$ of a bounded…

Let $R$ be a commutative ring with identity and let $M$ be an $R$-module which is generated by $\mu$ elements but not fewer. We denote by $\operatorname{SL}_n(R)$ the group of the $n \times n$ matrices over $R$ with determinant $1$. We…

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

We consider a sequence of fractional Ornstein-Uhlenbeck processes, that are defined as solutions of a family of stochastic Volterra equations with kernel given by the Riesz derivative kernel, and leading coefficients given by a sequence of…

We use polyhedral product models to analyse the structure of the commutator subgroup of a right-angled Artin group. In particular, we provide a minimal set of generators for the commutator subgroup, consisting of special iterated…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

The general linear group acts on the space of several linear maps on the vector space as the basis change. Similarly, we have the actions of the orthogonal and symplectic groups. Generators and identities for the corresponding polynomial…

Deep generative models provide a systematic way to learn nonlinear data distributions, through a set of latent variables and a nonlinear "generator" function that maps latent points into the input space. The nonlinearity of the generator…

Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…

We present a randomised variant of an algorithm of Lucchini and Thakkar for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.

Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.