English
Related papers

Related papers: Some new problems in additive combinatorics

200 papers

Let A be an abelian surface over F_q, the field of q elements. The rational points on A/\F_q form an abelian group A(\F_q) \simeq \Z/n_1\Z \times \Z/n_1 n_2 \Z \times \Z/n_1 n_2 n_3\Z \times\Z/n_1 n_2 n_3 n_4\Z. We are interested in knowing…

Number Theory · Mathematics 2013-07-04 Chantal David , Derek Garton , Zachary Scherr , Arul Shankar , Ethan Smith , Lola Thompson

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

Group Theory · Mathematics 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

General Mathematics · Mathematics 2007-05-23 G. Bergdolt

Symmetry acting on a (2+1)$D$ topological order can be anomalous in the sense that they possess an obstruction to being realized as a purely (2+1)$D$ on-site symmetry. In this paper, we develop a (3+1)$D$ topological quantum field theory to…

Strongly Correlated Electrons · Physics 2023-07-13 Weicheng Ye , Liujun Zou

Let $\mathbb{F}_q$ be the finite field of $q$ elements and $a_1,a_2, \ldots, a_k, b\in \mathbb{F}_q$. We investigate $N_{\mathbb{F}_q}(a_1, a_2, \ldots,a_k;b)$, the number of ordered solutions $(x_1, x_2, \ldots,x_k)\in\mathbb{F}_q^k$ of…

Number Theory · Mathematics 2020-06-09 Jiyou Li , Xiang Yu

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Number Theory · Mathematics 2016-02-26 Zhi-Wei Sun

We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…

Combinatorics · Mathematics 2017-10-19 Zhicheng Gao , Andrew MacFie , Qiang Wang

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

Group Theory · Mathematics 2015-01-23 Mark L. Lewis , James B. Wilson

Permutation polynomials are of particular significance in several areas of applied mathematics, such as Coding theory and Cryptography. Many recent constructions are based on the Akbary-Ghioca-Wang (AGW) criterion. Along this line of…

Combinatorics · Mathematics 2022-01-05 Vincenzo Pallozzi Lavorante

Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…

Combinatorics · Mathematics 2017-08-01 Victor H. Moll , José L. Ramirez , Diego Villamizar

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

Number Theory · Mathematics 2010-02-18 Mohamed El Bachraoui

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

Group Theory · Mathematics 2021-07-01 Kanto Irimoto , Enrique Torres-Giese

Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…

Combinatorics · Mathematics 2024-02-14 Gyula Lakos

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

Group Theory · Mathematics 2007-05-23 Z. Hasan , A. Kasouha

Recently, P. Yuan presented a local method to find permutation polynomials and their compositional inverses over finite fields. The work of P. Yuan inspires us to compute the compositional inverses of three classes of the permutation…

Number Theory · Mathematics 2024-10-16 Danyao Wu , Pingzhi Yuan

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

Combinatorics · Mathematics 2023-09-26 Peter M. Higgins

This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…

Number Theory · Mathematics 2007-05-23 Umesh P. Nair

We give some new relations for Newman digit sums respectively different modulos and put some problems. In particular, for the odd prime modulos we put an important conjecture.

Number Theory · Mathematics 2011-11-10 Vladimir Shevelev

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

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

Discrete Mathematics · Computer Science 2010-07-29 Zan Pan