English
Related papers

Related papers: Surjective word maps and Burnsides $p^aq^b$ theore…

200 papers

Chevalley's theorem states that every smooth connected algebraic group over a perfect field is an extension of an abelian variety by a smooth connected affine group. That fails when the base field is not perfect. We define a pseudo-abelian…

Algebraic Geometry · Mathematics 2013-02-28 Burt Totaro

Two words $p$ and $q$ are avoided by the same number of length-$n$ words, for all $n$, precisely when $p$ and $q$ have the same set of border lengths. Previous proofs of this theorem use generating functions but do not provide an explicit…

Combinatorics · Mathematics 2023-12-04 Julia Carrigan , Isaiah Hollars , Eric Rowland

In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where…

Group Theory · Mathematics 2018-10-10 Wujie Shi

Suppose that a binary operation $\circ$ on a finite set $X$ is injective in each variable separately and also associative. It is easy to prove that $(X,\circ)$ must be a group. In this paper we examine what happens if one knows only that a…

Combinatorics · Mathematics 2021-02-26 W. T. Gowers , Jason Long

When we study the Karnaugh map in the switching theory course, we learn that the ones in the map must be combined in groups of $a \times b$ elements, being $a$ and $b$ powers of two. The result is the logic function described as a sum of…

Signal Processing · Electrical Eng. & Systems 2022-11-17 Mario Garrido

We study word maps with constants on symmetric groups. Even though there are mixed identities of bounded length that are valid for all symmetric groups, we show that no such identities hold in a metric sense. Moreover, we prove that word…

Group Theory · Mathematics 2023-05-18 Jakob Schneider , Andreas Thom

We prove several results on products of conjugacy classes in finite simple groups. The first result is that there always exists a uniform generating triple. This result and other ideas are used to solve a 1966 conjecture of Peter Neumann…

Group Theory · Mathematics 2011-01-26 Robert Guralnick , Gunter Malle

Let $N$ be a positive integer and let $J_0(N)$ be the Jacobian variety of the modular curve $X_0(N)$. For any prime $p\ge 5$ whose square does not divide $N$, we prove that the $p$-primary subgroup of the rational torsion subgroup of…

Number Theory · Mathematics 2023-05-24 Hwajong Yoo

We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…

Combinatorics · Mathematics 2014-06-06 Drew Armstrong , Nicholas A. Loehr , Gregory S. Warrington

We give a bijective correspondence between the number of nilpotent matrices over a Boolean semiring and the number of directed acyclic graphs on ordered vertices. We then enumerate pairs of maps between two finite sets whose composites are…

Combinatorics · Mathematics 2025-12-08 Weixi Chen , Mee Seong Im , Catherine Lillja , Nicolas Rugo

In this paper, we first show that the irreducible characters of a quotient table algebra modulo a normal closed subset can be viewed as the irreducible characters of the table algebra itself. Furthermore, we define the character products…

Representation Theory · Mathematics 2015-08-26 J. Bagherian , A. Rahnamai Barghi

We explore the concept of conjugation between subgroupoids, providing several characterizations of the conjugacy relation (Theorem A in {\S}1.2). We show that two finite groupoid-sets, over a locally strongly finite groupoid, are…

Group Theory · Mathematics 2021-06-29 Laiachi El Kaoutit , Leonardo Spinosa

We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…

Combinatorics · Mathematics 2026-01-26 Elia Bisi , Piotr Dyszewski , Nina Gantert , Samuel G. G. Johnston , Joscha Prochno , Dominik Schmid

We prove a broad generalization of a theorem of W. Burnside on real characters using permutation characters. Under a necessary hypothesis, We can give some control on multiplicities (a result that needs the Classification of Finite Simple…

Group Theory · Mathematics 2021-01-08 Robert Guralnick , Gabriel Navarro

The Seiberg-Witten map links noncommutative gauge theories to ordinary gauge theories, and allows to express the noncommutative variables in terms of the commutative ones. Its explicit form can be found order by order in the noncommutative…

High Energy Physics - Theory · Physics 2009-11-07 Stephane Fidanza

In this paper we undertake the general study of the Abelian complexity of an infinite word on a finite alphabet. We investigate both similarities and differences between the Abelian complexity and the usual subword complexity. While the…

Combinatorics · Mathematics 2014-02-26 Gwénaël Richomme , Kalle Saari , Luca Q. Zamboni

Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…

Algebraic Geometry · Mathematics 2024-12-20 Chatchai Noytaptim , Xiao Zhong

Let k be an algebraically closed subfield of the complex numbers, and X a variety defined over k. One version of the Beilinson-Hodge conjecture that seems to survive scrutiny is the statement that the Betti cycle class map cl_{r,m} :…

K-Theory and Homology · Mathematics 2014-04-07 Rob de Jeu , James D. Lewis , Deepam Patel

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

Group Theory · Mathematics 2007-05-23 Seymour Bachmuth

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

Logic in Computer Science · Computer Science 2007-05-23 Martin Ziegler , Klaus Meer
‹ Prev 1 4 5 6 7 8 10 Next ›