中文
相关论文

相关论文: On m-covers and m-systems

200 篇论文

Let $\zeta_k$ be a $k$-th primitive root of unity, $m\geq\phi(k)+1$ an integer and $\Phi_k(X)\in\mathbb Z [X]$ the $k$-th cyclotomic polynomial. In this paper we show that the pair $(-m+\zeta_k,\mathcal N)$ is a canonical number system,…

数论 · 数学 2014-08-04 Manfred Madritsch , Volker Ziegler

In this article, we first describe all nonempty sets of integers S with the property that for all n and m in S, not necessarily distinct, the set {n-m,n+m} intersected with S consists of a single element. These are the sets with at most two…

群论 · 数学 2026-02-03 Artūras Dubickas , Chris Smyth

For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…

综合数学 · 数学 2007-05-23 Linfan Mao

We study properties of an array of numbers, called "the triangle," in which each row is formed by rotating all the numbers in the previous row to the left by $m$ positions in cyclical fashion, then appending a number to the end of the row.…

数论 · 数学 2014-09-16 Philip Jameson Graber

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

数论 · 数学 2020-04-16 S. S. Rout , N. K. Meher

We provide a new way to represent numerical semigroups by showing that the position of every Ap\'ery set of a numerical semigroup $S$ in the enumeration of the elements of $S$ is unique, and that $S$ can be re-constructed from this…

交换代数 · 数学 2014-07-16 Lance Bryant , James Hamblin

We classify all totally real number fields of degree at most 5 that admit a universal quadratic form with rational integer coefficients; in fact, there are none over the previously unsolved cases of quartic and quintic fields. This fully…

数论 · 数学 2024-02-07 Vítězslav Kala , Pavlo Yatsyna

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

组合数学 · 数学 2007-05-23 William M. Y. Goh , Pawel Hitczenko , Ali Shokoufandeh

This paper gives a complete proof of a theorem of de Bruijn that classifies additive systems for the nonnegative integers, that is, families $\mca = (A_i)_{i\in I}$ of sets of nonnegative integers, each set containing 0, such that every…

数论 · 数学 2014-01-03 Melvyn B. Nathanson

We prove a conjecture of Dukes and Herke concerning the possible orders of a basis for the cyclic group Z_n, namely : For each k \in N there exists a constant c_k > 0 such that, for all n \in N, if A \subseteq Z_n is a basis of order…

数论 · 数学 2009-07-04 Peter Hegarty

In this note, we present a new proof that the cyclotomic integers constitute the full ring of integers in the cyclotomic field.

交换代数 · 数学 2020-01-22 Nicholas Phat Nguyen

We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…

数论 · 数学 2016-02-09 Tim Beyne , Gerold Brändli

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

经典分析与常微分方程 · 数学 2012-05-07 Pedro J. Freitas , Shmuel Friedland , Gaspar Porta

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$, $s_1,s_2\in S$ and $s_1<s_2$. Let $A$ be the set of all…

数论 · 数学 2021-11-16 Kai-Jie Jiao , Csaba Sándor , Quan-Hui Yang , Jun-Yu Zhou

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

数论 · 数学 2026-02-11 Zhi-Wei Sun

We show that if a big set of integer points in [0,N]^d, d>1, occupies few residue classes mod p for many primes p, then it must essentially lie in the solution set of some polynomial equation of low degree. This answers a question of…

数论 · 数学 2019-12-19 Miguel N. Walsh

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

组合数学 · 数学 2018-05-01 Daniel Yaqubi , Madjid Mirzavaziri

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…

数论 · 数学 2019-10-23 Hung Viet Chu , Noah Luntzlara , Steven J. Miller , Lily Shao

We consider the number of partitions of $n$ whose Young diagrams fit inside an $m \times \ell$ rectangle; equivalently, we study the coefficients of the $q$-binomial coefficient $\binom{m+\ell}{m}_q$. We obtain sharp asymptotics throughout…

组合数学 · 数学 2019-02-05 Stephen Melczer , Greta Panova , Robin Pemantle

For a class of arithmetic subgroups $\Gamma$ in SU(d,1) we prove that for every positive integer $n$ there exists a subgroup $\Gamma_n$ of finite index in $\Gamma$, which lifts to the $n$-fold connected cover of of SU(d,1). Consequently…

群论 · 数学 2021-08-11 Richard M. Hill