Related papers: An elementary additive doubling inequality

We demonstrate equivalence between two definitions of lower finite highest weight categories. We also show that, in the presence of a duality, a lower finite highest weight structure on a category is unique. Finally, we give a new proof for…

In this paper, we prove that the endomorphism rings End A and End A' of periodic infinite Abelian groups A and A' are elementarily equivalent if and only if the endomorphism rings of their p-components are elementarily equivalent for all…

A short and elementary proof of the joint convexity of relative entropy is presented, using nothing beyond linear algebra. The key ingredients are an easily verified integral representation and the strategy used to prove the Cauchy-Schwarz…

Algebraic hyperstructures represent a natural extension of classical algebraic structures. In a classical algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two…

We define an abelian loop on a set $S$ consisting of 1 and all odd prime numbers with an operation $\bullet$, where for $a,b$ $\in$ $S$, $a$ $ \bullet$ $b$ is the smallest element of $S$ strictly larger than $|a-b|$. We use theorems and…

Tarnauceanu [Archiv der Mathematik, 102 (1), (2014), 11--14] gave a characterisation of elementary abelian $2$-groups in terms of their maximal sum-free sets. His theorem states that a finite group $G$ is an elementary abelian $2$-group if…

This is an expository work presenting in detail the proof of the structure theorem for divisible abelian groups. A divisible abelian group is an abelian group that satisfies nD=D for all natural n. The theorem states that any divisible…

We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.

We extend a conjecture of Kimberley-Robertson on the abelianizations of certain square complex groups.

We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…

Given an infinite group $G$ and a subset $A$ of $G$ we let $\Delta(A) = {g \in G : |gA \cap A| =\infty}$ (this is sometimes called the combinatorial derivation of $A$). A subset $A$ of $G$ is called large if there exists a finite subset $F$…

We classify elementary abelian 2 subgroups of compact simple Lie groups of adjoint type. This finishes the classification of elementary abelian $p$ subgroups of compact (or linear algebraic) simple groups of adjoint type.

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

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.

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

It is shown that universal algebras that are injective in their equational classes are characterized by internal property that can be called completeness. We define universal algebra $A$ as complete (closed to simple extensions) if for each…

For any real division algebra A of finite dimension greater than one, the signs of the determinants of left multiplication and right multiplication by a non-zero element are shown to form an invariant of A, called its double sign. The…

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…

We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.