Related papers: Reflection length in the general linear and affine…
Glider representations can be defined for a finite algebra filtration FKG determined by a chain of subgroups 1 < G_1 < ... < G_d = G. In this paper we develop the generalized character theory for such glider representations. We give the…
A very useful result concerning flatness in Algebraic Geometry is EGA's ``fiber'' criterion. We propose similar fiber criteria to verify flatness of a module while avoiding ``finiteness'' assumptions. Motivated by a Tannakian viewpoint…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
This note summarizes the steps to computing the best-fitting affine reflection that aligns two sets of corresponding points.
This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…
We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.
We prove that the Hurwitz action on reflection factorizations of Coxeter elements is transitive up to certain natural constraints in the complex reflection groups G4 and G5. This affirms a more general conjecture by Lewis and Reiner in…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
We present algorithms for the group independent reduction of group theory factors of Feynman diagrams. We also give formulas and values for a large number of group invariants in which the group theory factors are expressed. This includes…
For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…
Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…
We study the complex irreducible representations of special linear, symplectic, orthogonal and unitary groups over principal ideal local rings of length two. We construct a canonical correspondence between the irreducible representations of…
We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.
We study a combinatorial object, which we call a GRRS (generalized reflection root system); the classical root systems and GRSs introduced by V. Serganova are examples of finite GRRSs. A GRRS is finite if it contains a finite number of…
We prove the following theorem. Let $G$ be a finite group generated by unitary reflections in a complex Hermitian space $V=\mathbb{C}^\ell$ and let $G'$ be any reflection subgroup of $G$. Let $\mathcal{H}(G)$ be the space of $G$-harmonic…
Let $G$ be a group and $\alpha: G \times G \to G$ denote the commutator map. In the case of finite groups, Frobenius gave the formula to compute the cardinalities of the fibres $\alpha^{-1}(g)$ in terms of the character values $\chi(g)$ for…
We give a criterion of factoriality of a suspension. This allows to construct many examples of flexible affine factorial varieties. In particular, we find a homogeneous affine factorial 3-fold that is not a homogeneous space of an algebraic…
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap…
Reflection length and codimension of fixed point spaces induce partial orders on a complex reflection group. While these partial orders are of independent combinatorial interest, our investigation is motivated by a connection between the…
While recent advances in large reasoning models have demonstrated remarkable performance, efficient reasoning remains critical due to the rapid growth of output length. Existing optimization approaches highlights a tendency toward…