中文
相关论文

相关论文: Classification of Ramification Systems for Symmetr…

200 篇论文

We study the examples mentioned in [2,Tables A & C] and establish the arithmeticity of four examples of symplectic hypergeometric groups of degree six. Following [2] we know that there are 458 inequivalent symplectic hypergeometric groups…

群论 · 数学 2022-03-11 Jitendra Bajpai

An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.

数学软件 · 计算机科学 2012-01-17 Krasimir Yordzhev , Lilyana Totina

We find a polynomial (n^6) isoperimetric function for Artin groups, the defining graph of which contains no edges labelled by 3. This in particular shows that even Artin groups have solvable word problem. We use small cancellation theory of…

群论 · 数学 2025-07-23 Arye Juhasz

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

数据结构与算法 · 计算机科学 2013-12-12 David Rosenbaum

We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…

群论 · 数学 2013-09-06 E. A. O'Brien , C. Voll

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

群论 · 数学 2018-11-14 Avraham Aizenbud , Nir Avni

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…

We prove an asymptotic formula for the number of $n$-dimensional representations of the group $\mathrm{SU}(3)$. Main tools for the proof are Wright's Circle Method and the Saddle Point Method.

表示论 · 数学 2021-07-08 Kathrin Bringmann , Johann Franke

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. The word-representability of split graphs was studied in a series of papers in the literature, and the class of word-representable split…

组合数学 · 数学 2025-04-29 Tithi Dwary , Khyodeno Mozhui , K. V. Krishna

We construct parameterized families of imaginary (resp. real) quadratic fields whose class groups have $n$-rank at least $2$.

数论 · 数学 2024-12-31 Azizul Hoque , Srinivas Kotyada

We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…

组合数学 · 数学 2020-07-07 Rosa Orellana , Mike Zabrocki

We describe the subgroups of the group $\Z_m \times \Z_n \times \Z_r$ and derive a simple formula for the total number $s(m,n,r)$ of the subgroups, where $m,n,r$ are arbitrary positive integers. An asymptotic formula for the function…

群论 · 数学 2013-04-11 Mario Hampejs , László Tóth

A packing of subsets $\mathcal S_1,..., \mathcal S_n$ in a group $G$ is a sequence $(g_1,...,g_n)$ such that $g_1\mathcal S_1,...,g_n\mathcal S_n$ are disjoint subsets of $G$. We give a formula for the number of packings if the group $G$ is…

组合数学 · 数学 2012-10-04 Roland Bacher

The branching theorem expresses irreducible character values for the symmetric group $S_n$ in terms of those for $S_{n-1}$, but it gives the values only at elements of $S_n$ having a fixed point. We extend the theorem by providing a…

群论 · 数学 2017-12-22 Randall R. Holmes

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…

信息论 · 计算机科学 2013-03-26 Cristiano Torezzan , João E. Strapasson , Sueli I. R. Costa , Rogerio M. Siqueira

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

群论 · 数学 2017-07-21 Avinoam Mann

We decompose the restriction of ramified principal series representations of the $p$-adic group $\mathrm{GL}(3,\mathrm{k})$ to its maximal compact subgroup $K=\mathrm{GL}(3,\mathscr{R})$. Its decomposition is dependent on the degree of…

表示论 · 数学 2007-10-18 Peter S. Campbell , Monica Nevins

Groups associated to surfaces isogenous to a higher product of curves can be characterised by a purely group-theoretic condition, which is the existence of a so-called ramification structure. In this paper, we prove that infinitely many…

群论 · 数学 2021-10-26 Marialaura Noce , Anitha Thillaisundaram

We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers,…

数论 · 数学 2009-09-29 Javier Cilleruelo , Imre Z. Ruzsa , Carlos Vinuesa