English
Related papers

Related papers: Symmetric Kneser's Theorem with Trios and $3$-Tran…

200 papers

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Group Theory · Mathematics 2026-03-10 Saveliy V. Skresanov

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

Let $G$ be a multiplicative group, let $A,B \subseteq G$ be finite and nonempty, and define the product set $AB = {ab \mid $a \in A$ and $b \in B$}$. Two fundamental problems in combinatorial number theory are to find lower bounds on…

Combinatorics · Mathematics 2013-09-10 Matt DeVos

In the realm of Boltzmann-Gibbs (BG) statistical mechanics and its q-generalisation for complex systems, we analyse observed sequences of q-triplets, or q-doublets if one of them is the unity, in terms of cycles of successive M\"obius…

Statistical Mechanics · Physics 2020-01-08 Jean-Pierre Gazeau , Constantino Tsallis

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

Group Theory · Mathematics 2010-04-22 Ben Fairbairn

We provide a superselection theory of symmetry defects in 2+1D symmetry enriched topological (SET) order in the infinite volume setting. For a finite symmetry group $G$ with a unitary on-site action, our formalism produces a $G$-crossed…

Mathematical Physics · Physics 2025-03-26 Kyle Kawagoe , Siddharth Vadnerkar , Daniel Wallick

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…

Representation Theory · Mathematics 2014-12-05 Laurent Manivel

We prove the following theorem. Let $G$ be a finite group generated by unitary reflections in a complex Hermitian space $V=\mathbb{C}^\ell$ and let $G'$ be any reflection subgroup of $G$. Let $\mathcal{H}(G)$ be the space of $G$-harmonic…

Representation Theory · Mathematics 2020-01-10 G. I. Lehrer

We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$.…

Data Structures and Algorithms · Computer Science 2025-02-12 Pascal Koiran

It is proved that for any non-empty finite subset $Q$ of the square numbers, $ |Q+Q|\geq C'|Q|(\log |Q|)^{1/3+o(1)} $. This result essentially is proved -- with the same tools -- by Mei-Chu Chang. See in J. Funct. Anal. 207 (2004), no 2,…

Combinatorics · Mathematics 2025-04-24 Norbert Hegyvári

A well-known result by Kemperman describes the structure of those pairs (A,B) of finite subsets of an abelian group satisfying |A+B|\le|A|+|B|-1. We establish a description which is, in a sense, dual to Kemperman's, and as an application…

Number Theory · Mathematics 2007-05-23 Vsevolod F. Lev

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Dynamical Systems · Mathematics 2024-02-23 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We give a transform of convergent trigonometric series into equivalent convergent series and sufficient conditions for the transformed series to converge faster than the original one.

Numerical Analysis · Mathematics 2012-08-31 Faton M. Berisha , Milan H. Filipović

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

Logic · Mathematics 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

Quantum theory may be formulated using Hilbert spaces over any of the three associative normed division algebras: the real numbers, the complex numbers and the quaternions. Indeed, these three choices appear naturally in a number of…

Quantum Physics · Physics 2015-05-27 John C. Baez

A novel approach to the finite dimensional representation theory of the entire Lorentz group $\operatorname{O}(1,3)$ is presented. It is shown how the entire Lorentz group may be understood as a semi-direct product between its identity…

Mathematical Physics · Physics 2025-04-11 Craig McRae

Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…

Combinatorics · Mathematics 2020-12-07 Simona Bonvicini , Marco Buratti , Martino Garonzi , Gloria Rinaldi , Tommaso Traetta

Let $G$, $H$ be groups. We denote by $\eta(G,H)$ a certain extension of the non-abelian tensor product $G \otimes H$ by $G \times H$. We prove that if $G$ and $H$ are groups that act compatibly on each other and such that the set of all…

Group Theory · Mathematics 2018-10-23 Raimundo Bastos , Irene N. Nakaoka , Noraí R. Rocco

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt
‹ Prev 1 4 5 6 7 8 10 Next ›