English
Related papers

Related papers: Abelian Nivat's conjecture for non-rectangular pat…

200 papers

For a finite non-abelian group $G$ let $\rat(G)$ denote the largest ratio of degrees of two nonlinear irreducible characters of $G$. We prove that the number of non-abelian composition factors of $G$ is bounded above by…

Group Theory · Mathematics 2015-02-26 Mark L. Lewis , Hung Ngoc Nguyen

The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We define the \emph{maximal complexity} C(w) as the maximum of the…

Discrete Mathematics · Computer Science 2010-02-16 M-C. Anisiu , Z. Blazsik , Z. Kasa

Based on the recent development of commutator theory for loops, we provide both syntactic and semantic characterization of abelian normal subloops. We highlight the analogies between well known central extensions and central nilpotence on…

Group Theory · Mathematics 2015-09-21 David Stanovský , Petr Vojtěchovský

Let $\mathfrak F$ be a class of groups. A group $G$ is called $ca$-$\mathfrak F$-group if its every non-abelian chief factor is simple and $H/K \leftthreetimes C_G(H/K) \in \mathfrak F$ for every abelian chief factor $H/K$ of $G$. In this…

Group Theory · Mathematics 2016-03-15 Evgeniy N. Myslovets , Alexander F. Vasil'ev

We consider a new family of factorial languages whose subword complexity grows as $\Theta(n^{\alpha})$, where $\alpha$ is the root of some transcendent equation. Analytical methods and in particular, a corollary of the Wiener-Pitt theorem,…

Combinatorics · Mathematics 2010-12-30 Julien Cassaigne , Anna Frid , Fedor Petrov

The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Golnaz Badkobeh , Maxime Crochemore

By a result of Noritzsch, a finite solvable group whose non-linear character degrees have the same set of prime divisors is meta-abelian. In this note we investigate finite non-solvable groups whose non-linear character degrees have the…

Representation Theory · Mathematics 2026-04-14 Junying Guo , Yanjun Liu , Ziyi Wu , Di Xiao

The concept of gauge invariance can be considered one of the most subtle and useful concept in theoretical physics since it can permit the comprehension of difficult systems in physics with an arbitrary choice of a reference frame at every…

High Energy Physics - Theory · Physics 2010-01-19 E. M. C. Abreu , J. Ananias Neto , A. C. R. Mendes , C. Neves , W. Oliveira

We investigate Abelian primitive words, which are words that are not Abelian powers. We show that unlike classical primitive words, the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive…

Formal Languages and Automata Theory · Computer Science 2010-06-25 Michael Domaratzki , Narad Rampersad

A theorem of Z. Arad and E. Fisman establishes that if $A$ and $B$ are two conjugacy classes of a finite group $G$ such that either $AB=A\cup B$ or $AB=A^{-1} \cup B$, then $G$ cannot be non-abelian simple. We demonstrate that, in fact,…

Group Theory · Mathematics 2024-10-04 Antonio Beltrán , María José Felipe , Carmen Melchor

A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…

Combinatorics · Mathematics 2020-11-26 Jarosław Grytczuk , Szymon Stankiewicz

Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with…

Group Theory · Mathematics 2017-03-14 Alexander Bors

Generalizing the notion of automatic complexity of individual strings due to Shallit and Wang, we define the automatic complexity $A(E)$ of an equivalence relation $E$ on a finite set $S$ of strings. We prove that the problem of determining…

Formal Languages and Automata Theory · Computer Science 2020-02-03 Bjørn Kjos-Hanssen

Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple…

Data Structures and Algorithms · Computer Science 2017-01-02 Gabriele Fici , Thierry Lecroq , Arnaud Lefebvre , Élise Prieur-Gaston , William F. Smyth

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

We investigate the notion of complexity for finitely presented groups and the related notion of complexity for three-dimensional manifolds. We give two-sided estimates on the complexity of all the Milnor groups (the finite groups with free…

Geometric Topology · Mathematics 2011-01-18 Ekaterina Pervova , Carlo Petronio

One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…

Computational Complexity · Computer Science 2010-03-08 Deepak Ponvel Chermakani

In this paper, we introduce and investigate a concept of Abel statistical continuity. A real valued function $f$ is Abel statistically continuous on a subset $E$ of $\R$, the set of real numbers, if it preserves Abel statistical convergent…

Functional Analysis · Mathematics 2017-11-28 Iffet Taylan , Huseyin Cakalli

This is the second installment of an exposition of an ACL2 formalization of finite group theory. The first, which was presented at the 2022 ACL2 workshop, covered groups and subgroups, cosets, normal subgroups, and quotient groups,…

Discrete Mathematics · Computer Science 2023-11-16 David M. Russinoff

In this paper we will prove that Tate conjecture of abelian varieties over finite field is equivalent to the finiteness of isomorphism classes of abelian varieties with a fixed dimension. We give a different approach with Zarhin's result.

Algebraic Geometry · Mathematics 2019-01-08 Anningzhe Gao
‹ Prev 1 8 9 10 Next ›