English
Related papers

Related papers: An Abelian Loop for Non-Composites

200 papers

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

We study the various term operations on the set of skew primitive elements of Hopf algebras, generated by skew primitive semi-invariants of an Abelian group of grouplike elements. All 1-linear binary operations are described and trilinear…

Quantum Algebra · Mathematics 2007-05-23 V. K. Kharchenko

In this paper, we classify the possible group structures on the set of $R$-valued points of an abelian variety, where $R$ is any real closed field. We make use of a family of abelian varieties that, in effect, allows one to quantify over…

Algebraic Geometry · Mathematics 2023-05-31 Nathanial Lowry

Let $G$ be a finite group and $C_2$ the cyclic group of order 2. Consider the 8 multiplicative operations $(x,y)\mapsto (x^iy^j)^k$, where $i$, $j$, $k\in\{-1, 1\}$. Define a new multiplication on $G\times C_2$ by assigning one of the above…

Group Theory · Mathematics 2007-05-23 Petr Vojtěchovský

If we pick two elements of a non-abelian group at random, the odds this pair commutes is at most 5/8, so there is a "gap" between abelian and non-abelian groups \cite{G}. We prove a "topological" generalization estimating the odds a word…

Group Theory · Mathematics 2012-05-29 John Mangual

Let $X$ be an $n$-element set. A set-pair system $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ is a collection of pairs of disjoint subsets of $X$. It is called skew Bollob\'as system if $A_i\cap B_j\neq \emptyset$ for all $1\leq i<j \leq…

Combinatorics · Mathematics 2023-07-28 Gábor Hegedüs , Péter Frankl

We show that any abelian variety that is not affine has a nontrivial strongly abelian subvariety. In later papers in this sequence we apply this result to the study of minimal abelian varieties.

Logic · Mathematics 2020-08-21 Keith A. Kearnes , Emil W. Kiss , Agnes Szendrei

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

Combinatorics · Mathematics 2016-02-24 Kevin Henriot

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Information Theory · Computer Science 2017-10-16 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

An abelian square is a string of length 2n where the last n symbols form a permutation of the first n symbols. In this note we count the number of abelian squares and give an asymptotic estimate of this quantity.

Combinatorics · Mathematics 2008-08-01 L. B. Richmond , J. Shallit

An abelian anti-power of order $k$ (or simply an abelian $k$-anti-power) is a concatenation of $k$ consecutive words of the same length having pairwise distinct Parikh vectors. This definition generalizes to the abelian setting the notion…

Combinatorics · Mathematics 2019-03-26 Gabriele Fici , Mickael Postic , Manuel Silva

In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…

Number Theory · Mathematics 2011-10-11 Benjamin Girard

Any group that has a subnormal series, in which all factors are abelian and all except the last one are $p'$-torsion-free, can be embedded into a group with a subnormal series of the same length, with the same properties and such that any…

Group Theory · Mathematics 2024-10-29 Mikhail A. Mikheenko

In this note, basing on a certain functional equation of the dilogarithm function, we establish nontrivial lower bounds for the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers involving harmonic…

Number Theory · Mathematics 2022-12-08 Bakir Farhi

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

Number Theory · Mathematics 2023-02-09 Aliaksei Semchankau

We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…

Information Theory · Computer Science 2012-05-28 Gladys Chalom , Raul Antônio Ferraz , Marinês Guerreiro , César Polcino Milies

Let $\b$ be a Borel subalgebra of a simple Lie algebra $\g$ and let $\Ab$ denote the set of all Abelian ideals of $\b$. We consider $\Ab$ as poset with respect to inclusion, the zero ideal being the unique minimal element of $\Ab$. It was…

Representation Theory · Mathematics 2007-05-23 Dmitri I. Panyushev

We study the properties of a non-abelian gauge theory subjected to a gauge invariant constraint given by the classical equations of motion. The constraint is not imposed by hand, but appears naturally when we study a particular type of…

High Energy Physics - Theory · Physics 2016-08-16 Jorge Alfaro , Pedro Labraña

A classical result by Solodov states that if a group acts on the line such that any non-trivial element has at most one fixed point, then the action is either abelian or semi-conjugate to an affine action. We show that the same holds if we…

Group Theory · Mathematics 2022-10-17 João Carnevale

By introducing the concepts of a loop and a loop formula, Lin and Zhao showed that the answer sets of a nondisjunctive logic program are exactly the models of its Clark's completion that satisfy the loop formulas of all loops. Recently,…

Artificial Intelligence · Computer Science 2023-07-19 Martin Gebser , Joohyung Lee , Yuliya Lierler