Related papers: Constructive Membership Tests in Some Infinite Mat…
Working in the setting of Deligne categories, we generalize a result of Marin that hooks generate the representation ring of symmetric groups to wreath products of symmetric groups with a fixed finite group or Hopf algebra. In particular,…
We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…
A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…
The characteristic identity formalism discussed in our recent articles is further utilized to derive matrix elements of type 2 unitary irreducible $gl(m|n)$ modules. In particular, we give matrix element formulae for all gl(m|n) generators,…
We study the problem of building generative models of natural source code (NSC); that is, source code written and understood by humans. Our primary contribution is to describe a family of generative models for NSC that have three key…
The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…
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…
We construct a 2-generator recursively presented group with infinite torsion length. We also explore the construction in the context of solvable and word-hyperbolic groups.
We classify bireflectional elements (products of 2 involutions) in symplectic groups Sp$(2n, K)$ over a field $K$. We also classify rev ersible elements (elements conjugate to their inverses) and bireflectional elements in finite projective…
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)…
Groups preserving a distributive product are encountered often in algebra. Examples include automorphism groups of associative and nonassociative rings, classical groups, and automorphism groups of p-groups. While the great variety of such…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
Let G be a group generated by $r$ elements $g_1,g_2,..., g_r.$ Among the reduced words in $g_1,g_2,..., g_r$ of length $n$ some, say $\gamma_n,$ represent the identity element of the group $G.$ It has been shown in a combinatorial way that…
We obtain asymptotic formulas for the number of matrices in the congruence subgroup \[ \Gamma_0(Q) = \left\{ A\in\mathrm{SL}_2(\mathbb Z):~c \equiv 0 \pmod Q\right\}, \] which are of naive height at most $X$. Our result is uniform in a very…
For any matrix A in R^(m x n) of rank \rho, we present a probability distribution over the entries of A (the element-wise leverage scores of equation (2)) that reveals the most influential entries in the matrix. From a theoretical…
Matrix generators for the general and special linear groups, the symplectic groups and the general and special unitary groups over finite fields. For the most part the generators have been obtained by translating Steinberg's generators for…
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
Using our recent results on eigenvalues of invariants associated to the Lie superalgebra gl(m|n), we use characteristic identities to derive explicit matrix element formulae for all gl(m|n) generators, particularly non-elementary…
We use an extension of the diagrammatic rules in random matrix theory to evaluate spectral properties of finite and infinite products of large complex matrices and large hermitian matrices. The infinite product case allows us to define a…