中文
相关论文

相关论文: Additive triples in groups of odd prime order

200 篇论文

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

组合数学 · 数学 2008-12-04 Zhi-Wei Sun

Schur's theorem states that in any $k$-colouring of the set of integers $[n]$ there is a monochromatic solution to $a+b=c$, provided $n$ is sufficiently large. Abbott and Wang studied the size of the largest subset of $[n]$ such that there…

组合数学 · 数学 2026-02-17 Letícia Mattos , Domenico Mergoni Cecchelli , Olaf Parczyk

The ternary Goldbach conjecture states that every odd number $m \geqslant 7$ can be written as the sum of three primes. We construct a set of primes $\mathbb{P}$ defined by an expanding system of admissible congruences such that almost all…

For any odd prime $p$, the Galois group of the maximal unramified pro-$p$-extension of an imaginary quadratic field is a Schur $\sigma$-group. But Schur $\sigma$-groups can also be constructed and studied abstractly. We prove that if $p>3$,…

数论 · 数学 2025-05-19 Richard Pink

Recently Rai obtained an upper bound for the order of the Schur multiplier of a $d$-generator special $p$-group when its derived subgroup has the maximum value $ p^{\frac{1}{2}d(d-1)}$ for $ d\geq 3 $ and $ p\neq 2. $ Here we try to obtain…

群论 · 数学 2018-07-16 Farangis Johari , Peyman Niroomand

Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon that `more often' P(x;d,n)>P(x;d,r) than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If…

数论 · 数学 2007-05-23 Pieter Moree

Osburn, Sahu and Straub introduced the numbers: \begin{align*} A_n^{(r,s,t)}=\sum_{k=0}^n{n\choose k}^r{n+k\choose k}^s{2k\choose n}^t, \end{align*} for non-negative integers $n,r,s,t$ with $r\ge 2$, which includes two kinds of Ap\'ery…

数论 · 数学 2024-04-26 Ji-Cai Liu

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…

组合数学 · 数学 2013-09-10 Matt DeVos

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

逻辑 · 数学 2026-03-18 Amador Martin-Pizarro , Daniel Palacín

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

数论 · 数学 2007-05-23 Ernie Croot , Christian Elsholtz

We present a formula for the Schur multiplier norm of a complex self-adjoint matrix, and a formula for the norm, which is dual to the Schur multiplier norm, of a self-adjoint matrix. For a complex self-adjoint $n \times n $ matrix $X$ we…

泛函分析 · 数学 2026-04-28 Erik Christensen

Motivated by a problem in additive Ramsey theory, we extend Todorcevic's partitions of three-dimensional combinatorial cubes to handle additional three-dimensional objects. As a corollary, we get that if the continuum hypothesis fails, then…

逻辑 · 数学 2023-01-05 Ido Feldman , Assaf Rinot

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

组合数学 · 数学 2021-07-01 Imre Ruzsa , Jozsef Solymosi

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…

数论 · 数学 2026-01-14 Bhuwanesh Rao Patil , Mohan

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…

群论 · 数学 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

In the course of the proof of the irrationality of zeta(2) R. Apery introduced numbers b_n = \sum_{k=0}^n {n \choose k}^2{n+k \choose k}. Stienstra and Beukers showed that for the prime p > 3 Apery numbers satisfy congruence b((p-1)/2) =…

数论 · 数学 2019-01-11 Matija Kazalicki

In 1998, G. Ellis defined the Schur multiplier of a pair $(G,N)$ of groups and mentioned that this notion is a useful tool for studying pairs of groups. In this paper, we characterize the structure of a pair of finite $p$-groups $(G,N)$ in…

群论 · 数学 2015-11-26 Azam Hokmabadi , Fahimeh Mohammadzadeh , Behrooz Mashayekhy

Motivated by spin modular representations of the symmetric groups, we propose two generalizations of the Schur regular partitions for an odd integer $p\geq 3$. One forms a subset of the set of $p$-strict partitions, and the other forms that…

量子代数 · 数学 2024-02-13 Shunsuke Tsuchioka , Masaki Watanabe

For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…

数论 · 数学 2025-08-19 Sarvagya Jain

Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as…

数论 · 数学 2021-06-29 Sean Bibby , Pieter Vyncke , Joshua Zelinsky