Neil Saunders
We calculate the minimal degree for a class of finite complex reflection groups $G(p,p,q)$, for $p$ and $q$ primes and establish relationships between minimal degrees when these groups are taken in a direct product.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let $\ell$ be a prime divisor of the order of a finite unitary reflection group. We classify up to conjugacy the parabolic and reflection subgroups that are minimal with respect to inclusion, subject to containing an $\ell$-Sylow subgroup. The classification assists in describing the $\ell$-Sylow subgroups of unitary reflection groups up to group isomorphism. This classification also relates to the modular representation theory of finite groups of Lie type. We observe that unless a parabolic subgroup minimally containing an $\ell$-Sylow subgroup is $G$ itself, the reflection subgroup within th…
This paper have serious error in the proof of main theorem 1.1.Result is not proved.
The reflection length of an element of a Coxeter group is the minimal number of conjugates of the standard generators whose product is equal to that element. In this paper we prove the conjecture of McCammond and Petersen that reflection length is unbounded in any non-affine Coxeter group. Among the tools used, the construction of word-hyperbolic quotients of all minimal non-affine Coxeter groups might be of independent interest.
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we prove that the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely we prove that the reflection length function on an affine Coxeter group that naturally acts faithfully and cocompactly on $\R^n$ is bounded above by $2n$ and we also show that this bound is optimal. Conjecturally, spherical and affine Coxeter groups …
In this article we calculate the minimal faithful permutation degree for all of the irreducible Coxeter groups. We also exhibit new examples of finite groups that possess a quotient whose minimal degree is strictly greater than that of the group.
We give a modern account of Alfred Bochert's results from 1892 on the minimal degree of doubly, triply and quadruply transitive permutation groups.
The minimal faithful permutation degree of a finite group G is the least non-negative integer n such that G embeds in the symmetric group Sym(n). Work of Johnson and Wright established conditions for when the minimal degree of a direct product equals the sum of the minimal degrees for two finite groups. Wright asked whether this is true for all finite groups. A counter- example of degree 15 was provided by the referee and was added as an addendum in a paper of Wright. Here we provide a counter-example of degree 12.
Normalizers of Sylow subgroups in finite reflection groups
本文证明了有限反射群中西罗子群正规化子的半直积分解，并利用抛物子群与考克斯特图自同构给出实型情形的具体描述。
The minimal faithful permutation degree of a finite group $G$, denote by $μ(G)$ is the least non-negative integer $n$ such that $G$ embeds inside the symmetric group $\Sym(n)$. In this paper, we outline a Magma proof that 10 is the smallest degree for which there are groups $G$ and $H$ such that $μ(G \times H) < μ(G)+ μ(H)$.
Minimal degrees for faithful permutation representations of groups of order $p^6$ where $p$ is an odd prime
本文确定了奇素数 $p$ 下所有 $p^6$ 阶群的忠实置换表示的最小次数，并给出了构造方法。
In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary finite semiprimitive group in terms of its degree. To establish these bounds, we classify finite semiprimitive groups that induce the alternating or symmetric group on the set of orbits of an intransitive normal subgroup.
On the base size and minimal degree of transitive groups
本文证明对任意正数ε，存在传递置换群使基大小与最小次数的乘积至少为n的2-ε次方，并确定具有更小上界的传递与非传递群类。
In a discrete group generated by hyperplane reflections in the $n$-dimensional hyperbolic space, the reflection length of an element is the minimal number of hyperplane reflections in the group that suffices to factor the element. For a Coxeter group that arises in this way and does not split into a direct product of spherical and affine reflection groups, the reflection length is unbounded. The action of the Coxeter group induces a tessellation of the hyperbolic space. After fixing a fundamental domain, there exists a bijection between the tiles and the group elements. We describe certain poi…
In which it is proven that, for each parabolic quasi-Coxeter element in a finite real reflection group, the orbits of the Hurwitz action on its reflection factorizations are distinguished by the two obvious invariants
本文证明有限Coxeter群中抛物型拟Coxeter元素的反射分解的Hurwitz轨道由生成子群和共轭类多重集完全区分，并分类了满足极小生成集为最小大小的有限Coxeter群。
Minimal-order groups with an irreducible character of degree $p$ or $p^2$
本研究刻画了具有次数为素数$p$或$p^2$的不可约复特征标的极小阶有限群的结构特征。
The minimal degree of a permutation group $G$ is defined as the minimal number of non-fixed points of a non-trivial element of $G$. In this paper we show that if $G$ is a transitive permutation group of degree $n$ having no non-trivial normal $2$-subgroups such that the stabiliser of a point is a $2$-group, then the minimal degree of $G$ is at least $\frac{2}{3}n$. The proof depends on the classification of finite simple groups.
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support. These results contribute to the foundations of a non-commutative coding theory. A main application of our results concerns the Hidden Subgroup Problem for the symmetric group in Quantum Computing. We completely characterize the hidden subgroups of the symmetric group that can be distinguished from identity with weak Quantum Fourier Sampling, showing these ar…
Given a rank $n$ irreducible finite reflection group $W$, the $W$-invariant polynomial functions defined in ${\mathbb R}^n$ can be written as polynomials of $n$ algebraically independent homogeneous polynomial functions, $p_1(x),\ldots,p_n(x)$, called basic invariant polynomials. Their degrees are well known and typical of the given group $W$. The polynomial $p_1(x)$ has the lowest degree, equal to 2. It has been proved that it is possible to choose all the other $n-1$ basic invariant polynomials in such a way that they satisfy a certain system of differential equations, including the Laplace …
In a finite real reflection group, two factorizations of a Coxeter element into an arbitrary number of reflections are shown to lie in the same orbit under the Hurwitz action if and only if they use the same multiset of conjugacy classes. The proof makes use of a surprising lemma, derived from a classification of the minimal linear dependences (matroid circuits) in finite root systems: any set of roots forming a minimal linear dependence with positive coefficients has a disconnected graph of pairwise acuteness.
We give a lower bound on the expected degree of the free minimal spanning forest of a vertex transitive graph in terms of its spectral radius. This result answers a question of Lyons-Peres-Schramm and simplifies the Gaboriau-Lyons proof of the measurable-group-theoretic solution to von Neumann's problem. In the second part we study a relative version of the free minimal spanning forest. As a consequence of this study we can show that non-torsion unitarizable groups have fixed price one.
In contrast to the fact that there are only finitely many maximal arithmetic reflection groups acting on the hyperbolic space $\mathbb{H}^n$, $n\geq 2$, we show that: (a) one can produce infinitely many maximal quasi-arithmetic reflection groups acting on $\mathbb{H}^2$; (b) they admit infinitely many different fields of definition; (c) the degrees of their fields of definition are unbounded. However, for $n\geq 14$ an approach initially developed by Vinberg shows that there are still finitely many fields of definitions in the quasi-arithmetic case.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。