English
Related papers

Related papers: On Sequence Groups

200 papers

We lay the foundations of the first-order model theory of Coxeter groups. Firstly, with the exception of the $2$-spherical non-affine case (which we leave open), we characterize the superstable Coxeter groups of finite rank, which we show…

Logic · Mathematics 2022-02-02 Bernhard Muhlherr , Gianluca Paolini , Saharon Shelah

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Number Theory · Mathematics 2022-11-15 Joshua Zelinsky

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

Group Theory · Mathematics 2026-04-21 Ravi Ranjan , Shubh Narayan Singh , Surbhi Kumari , Shidra Jamil

We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…

Information Theory · Computer Science 2007-11-01 Paul Hurley , Ted Hurley

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

Group Theory · Mathematics 2016-11-21 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

We consider the capability of $p$ groups of class two and odd prime exponent. We use linear algebra and counting arguments to establish a number of new results. In particular, we settle the 4-generator case, and prove a sufficient condition…

Group Theory · Mathematics 2007-05-23 Arturo Magidin

Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one…

Combinatorics · Mathematics 2015-08-25 Zsolt Lángi , Márton Naszódi , János Pach , Gábor Tardos , Géza Tóth

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

Number Theory · Mathematics 2021-11-15 Andreas Weingartner

Inside the symmetric product of a very general curve, we consider the codimension-one subvarieties of symmetric tuples of points imposing exceptional secant conditions on linear series on the curve of fixed degree and dimension. We compute…

Algebraic Geometry · Mathematics 2016-02-03 Nicola Tarasca

This article is the third in a series the aim of which is to use Lie group theory to obtain exact analytic solutions of Delay Ordinary Differential Systems (DODSs). Such a system consists of two equations involving one independent variable…

Classical Analysis and ODEs · Mathematics 2020-07-09 Vladimir A. Dorodnitsyn , Roman Kozlov , Sergey V. Meleshko , Pavel Winternitz

Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…

Functional Analysis · Mathematics 2018-01-29 Helena Malinowski , Martin R. Weber

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

Integer sequences where each element is determined by a previous randomly chosen element are investigated analytically. In particular, the random geometric series x_n=2x_p with 0<=p<=n-1 is studied. At large n, the moments grow…

Statistical Mechanics · Physics 2007-05-23 E. Ben-Naim , P. L. Krapivsky

This is an essay about a certain family of elements in the general linear group GL(d,q) called primitive prime divisor elements, or ppd-elements. A classification of the subgroups of GL(d,q) which contain such elements is discussed, and the…

Group Theory · Mathematics 2014-12-03 Cheryl E. Praeger

By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we…

Probability · Mathematics 2017-07-28 I. Berkes , R. Tichy

In this paper, we continue the enumeration of Schur rings over cyclic groups. Cyclic groups of semiprime order $pq$, where $p$ and $q$ are distinct primes, are considered. Additionally, cyclic groups of order $4p$ are considered.

Group Theory · Mathematics 2021-03-18 Joseph Keller , Andrew Misseldine , Max Sullivan

We investigate compositional iteration of fractional order for transseries. For any large positive transseries $T$ of exponentiality 0, there is a family $T^{[s]}$ indexed by real numbers $s$ corresponding to teration of order $s$. It is…

Rings and Algebras · Mathematics 2020-09-03 G. A. Edgar

Let $E$ be an elliptic curve of rank $\text{rk}(E) \geq 1$, and let $E(\mathbb{F}_p)$ be the elliptic group of order $\#E(\mathbb{F}_p)=n$. The number of primes $p\leq x$ such that $n$ is prime is expected to be $\pi(x,E)=\delta(E)x/\log^2…

General Mathematics · Mathematics 2019-03-06 N. A. Carella

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

Group Theory · Mathematics 2017-05-16 A. Mohammadzadeh , A. R. Moghaddamfar

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

Number Theory · Mathematics 2022-06-22 Sergiy Koshkin