Related papers: Classification of Ramification Systems for Symmetr…
Parastrophes (conjugates) of a quasigroup can be divided into separate classes containing isotopic parastrophes. We prove that the number of such classes is always 1, 2, 3 or 6. Next we characterize quasigroups having a fixed number of such…
We present a systematic method to classify the four-level system using $SU(4)$ symmetry as the basis group. It is shown that this symmetry allows three dipole transitions which eventually leads to six possible configurations of the…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
Recently, various normalization layers have been proposed to stabilize the training of deep neural networks. Among them, group normalization is a generalization of layer normalization and instance normalization by allowing a degree of…
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…
Branching of symplectic groups is not multiplicity-free. We describe a new approach to resolving these multiplicities that is based on studying the associated branching algebra $B$. The algebra $B$ is a graded algebra whose components…
Let G be a complex connected reductive group. The representation ring R(G) admits a canonical filtration defined in terms of the lambda-structure. We compute the associated graded ring gr R(G) (over Q) and the Chern classes of a…
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…
We give a purely scheme theoretic construction of the filtration by ramification groups of the Galois group of a covering. The valuation need not be discrete but the normalizations are required to be locally of complete intersection.
The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…
We give explicit formulas for the asymptotic Betti numbers, over an arbitrary field, of the ordered configuration spaces of a graph. In characteristic zero, we further give explicit formulas for the asymptotic multiplicities in homology of…
We classify isomorphic classes of the homomorphisms of a root system $\Xi$ to a root system $\Sigma$ which do not change Cartan integers. We examine several types of isomorphic classes defined by the Weyl group of $\Sigma$, that of $\Xi$…
This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the…
An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number…
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 study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…
If all of the entries of a large $S_n$ character table are covered up and you are allowed to uncover one entry at a time, then how can you quickly identify all of the indexing characters and conjugacy classes? We present a fast algorithmic…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
We give explicit formulae for a class of complex linear unitary characters of the congruence subgroups $\Gamma_0(N)$ which involve a variant of Rademacher's $\Psi$ function. We then prove that these characters cover all characters of…
In this paper, we compute the number of distinct centralizers of some classes of finite rings. We then characterize all finite rings with $n$ distinct centralizers for any positive integer $n \leq 5$. Further we give some connections…