English
Related papers

Related papers: On the Geometry of the Multiplicatively Closed Set…

200 papers

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…

Rings and Algebras · Mathematics 2009-11-03 Miguel Couceiro , Lucien Haddad

Let G be a group of the form G_1* ... *G_n, the free product of n subgroups, and let M be a ZG-module of the form $\bigoplus_{i=1}^n M_i \otimes_{\mathbb{Z}G_i} \mathbb{Z}G$. We shall give formulae in various situations for $d_{ZG}(M)$, the…

Group Theory · Mathematics 2007-12-26 Karl W. Gruenberg , Peter A. Linnell

The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…

Combinatorics · Mathematics 2015-05-04 Felix Breuer , Brandt Kronholm

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Computational Geometry · Computer Science 2020-10-09 Stanislaw Ambroszkiewicz

It is proved that all finitely generated subgroups of generalized free product of two groups are finitely separable provided that free factors have this property and amalgamated subgroups are normal in corresponding factors and satisfy the…

Group Theory · Mathematics 2013-08-20 David Moldavanskii , Anastasiya Uskova

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

Group Theory · Mathematics 2026-04-21 Sean Eberhard , Elena Maini , Luca Sabatini , Gareth Tracey

We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed…

Combinatorics · Mathematics 2021-07-28 Ali K. Uncu

Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of…

Quantum Physics · Physics 2026-04-07 Buğra Gültekin , Solomon B. Samuel , Zafer Gedik

We show that finitely generated irreducible $\mathrm{II}_1$ subfactors are generic in the following sense. Given a separable $\mathrm{II}_1$ factor $M$ and an integer $n\geq 2$, equip the set of $n$-tuples of self-adjoint operators in $M$…

Operator Algebras · Mathematics 2025-06-03 Yoonkyeong Lee , Brent Nelson

The set $\Mfib$ of fibbinary numbers is defined via a bijection between the set $\BB{N}$ of natural numbers and $\Mfib$. Since the elements of $\Mfib$ do not exhaust $\BB{N}$, the structure of the complement $\overline{\Mfib}$ of $\Mfib$ in…

Number Theory · Mathematics 2024-06-19 A. J. Macfarlane

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

General Mathematics · Mathematics 2016-04-25 N. A. Carella

A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer $g$ is a primitive root, provided $g \neq -1$ and $g$ is not a perfect square. Thanks to work of Hooley, we know that this conjecture…

Number Theory · Mathematics 2015-04-16 Lee Troupe

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

Data Structures and Algorithms · Computer Science 2010-10-07 Ferdinando Cicalese , Ugo Vaccaro

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

Group Theory · Mathematics 2017-10-31 Timothy C. Burness

In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…

Rings and Algebras · Mathematics 2015-04-10 Dmitriy Zhuk

For a Kummer extension defined by the affine equation $y^{m}=\prod_{i=1}^{r} (x-\a_i)^{\lambda_i}$ over an algebraic extension $K$ of a finite field $\fq$, where $\la_i\in \Z\backslash\{0\}$ for $1\leq i\leq r$, $\gcd(m,q) = 1$, and…

Information Theory · Computer Science 2025-05-30 Huachao Zhang , Chang-An Zhao

Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…

Commutative Algebra · Mathematics 2021-01-15 Evelia R. García Barroso , Ignacio García-Marco , Irene Márquez-Corbella

Fix $k \geq 6$. We prove that any large enough finite group $G$ contains $k$ elements which span quadratically many triples of the form $(a,b,ab) \in S \times G$, given any dense set $S \subseteq G \times G$. The quadratic bound is…

Combinatorics · Mathematics 2019-02-22 Ching Wong