相关论文: Symmetric Generation of $J_2$ on 32 Letters

Denote the free group on two letters by F2 and the SL(3,C)-representation variety of F2 by R = Hom(F2, SL(3,C)). There is a SL(3,C)-action on the coordinate ring of R, and the geometric points of the subring of invariants is an affine…

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…

The super-algebraic structure of a generalized version of the Jaynes-Cummings model is investigated. We find that a Z2 graded extension of the so(2,1) Lie algebra is the underlying symmetry of this model. It is isomorphic to the…

Motivated by the observation that $2+2=4$, we consider four-dimensional $\mathcal{N}=2$ superconformal field theories on $S^2\times\Sigma$, turning on a suitable rigid supergravity background. On the one hand, reduction of a…

Given a square matrix $A$ over the integers, we consider the $\mathbb{Z}$-module $M_A$ generated by the set of all matrices that are permutation-similar to $A$. Motivated by analogous problems on signed graph decompositions and block…

Let $G$ be a simple cubic 2-connected plane graph. For every $2$-factor $X$ of $G$ having $n$-components there exists a simple hamiltonian plane graph $J \subset G^{2}$ such that $|E(J)|= |E(G)| + 2n -2$ and $\Delta(J) \leqslant 5$.

The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…

Motivated by Yabe's classification of symmetric $2$-generated axial algebras of Monster type, we introduce a large class of algebras of Monster type $(\alpha, \frac{1}{2})$, generalising Yabe's $\mathrm{III}(\alpha,\frac{1}{2}, \delta)$…

For two natural numbers $1<p_1<p_2$, with $\alpha = \frac{\log(p_1)}{\log(p_2)}$ irrational, we describe, in main Theorem $\Omega$ and in Note $1.5$, the factorization of two adjacent numbers in the multiplicatively closed subset $S =…

Replaced with revised (uncorrupted) version We present a general scheme for generating (2,2) symmetric fermionic string models and classify the models in D=8 and D=6 space time dimensions. We discuss the relationship to other…

A presentation by generators and relations of the $n$th symmetric power $B$ of a commutative algebra $A$ over a field of characteristic zero or greater than $n$ is given. This is applied to get information on a minimal homogeneous…

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

For a given hyperelliptic curve $C$ over a finite field with Jacobian $J_C$, we consider the hyperelliptic analogue of the congruential generator defined by $W_n=W_{n-1}+D$ for $n\geq 1$ and $D,W_0\in J_C$. We show that curves of genus 2…

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…

We show that, for SU(2) generators of arbitrary dimension $D$, there exist identities that express the completely symmetric product of $D$ matrices in terms of completely symmetric products of fewer number of matrices. We also indicate why…

We use a semigroup-theoretic construction by Peter Higgins in order to produce, for each even $n$, an $n$-state and 3-letter synchronizing automaton with the following two features: 1) all its input letters act as idempotent selfmaps of…

We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…