中文
相关论文

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

200 篇论文

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

组合数学 · 数学 2018-05-22 Toufik Mansour , Madjid Mirzavaziri , Daniel Yaqubi

Let $\mathcal{A}$ be a finite set of integers, and let $h\mathcal{A}$ denote the $h$-fold sumset of $\mathcal{A}$. Let $(h\mathcal{A})^{(t)}$ be subset of $h\mathcal{A}$ consisting of all integers that have at least $t$ representations as a…

数论 · 数学 2022-05-03 Melvyn B. Nathanson

For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier…

信息论 · 计算机科学 2014-07-09 Bocong Chen , Hai Q. Dinh , Yun Fan , San Ling

In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…

数论 · 数学 2022-11-09 Aarya Kumar , Siyu Peng , Vincent Tran

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

数论 · 数学 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

组合数学 · 数学 2019-07-16 Jose G. Mijares

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…

Letting $\delta_1(n,m)$ be the density of the set of integers with exactly one divisor in $(n,m)$, Erd\H{o}s wondered if $\delta_1(n,m)$ is unimodular for fixed $n$. We prove this is false in general, as the sequence $(\delta_1(n,m))$ has…

数论 · 数学 2025-01-20 Stijn Cambie

Erd\H{o}s and Graham proposed to determine the number of subsets $S \subseteq \left\{1,2,\dots,n\right\}$ with $\sum_{s \in S} 1/s = 1$ and asked, among other things, whether that number could be as large as $2^{n - o(n)}$. We show that the…

组合数学 · 数学 2024-04-30 Stefan Steinerberger

We associate some (old) convergent series related to definite integrals with the cyclotomic equation $x^m-1= 0$, for several natural numbers $m$; for example, for $m = 3$, $x^3-1 = (x-1)(1+x+x^2)$, leads to $\int_0^1dx\frac{1}{(1+x+x^2)} =…

数论 · 数学 2015-01-23 Luis J. Boya , Cristian Rivera

We study the period of the linear map $T:\mathbb{Z}_m^n\rightarrow \mathbb{Z}_m^n:(a_0,\dots,a_{n-1})\mapsto(a_0+a_1,\dots,a_{n-1}+a_0)$ as a function of $m$ and $n$, where $\mathbb{Z}_m$ stands for the ring of integers modulo $m$. Since…

数论 · 数学 2023-04-18 Bruno Dular

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

信息论 · 计算机科学 2015-10-05 Trygve Johnsen , Keisuke Shiromoto , Hugues Verdure

Let $s(m,n)$ denote the classical \DED sum, where $n$ is a positive integer and $m\in\{0,1,\ldots, n-1\}$, $(m,n)=1$. For a given positive integer $k$, we describe a set of at most $k^2$ numbers $m$ for which $s(m,n)$ may be $\ge s(k,n)$,…

数论 · 数学 2017-01-11 Kurt Girstmair

Let $\mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $\mathbb{C}$. Let $X$ be a subset of the Euclidean space $\mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in…

度量几何 · 数学 2023-05-09 Hiroshi Nozaki

We study the typical behavior of the least common multiple of the elements of a random subset $A\subset \{1,\dots, n\}$. For example we prove that $\text{lcm}\{a:\ a\in A\}=2^{n(1+o(1))}$ for almost all subsets $A\subset\{1,\dots,n\}$.

We show that any $m\times m$ matrix $M$ with integer entries and $\det M =\Delta \neq 0$ can be equipped by a finite digit set $\mathcal{D}\subset\mathbb{Z}^m$ such that any integer $m$-dimensional vector belongs to the set $$ {\rm…

数论 · 数学 2021-03-04 Edita Pelantová , Tomáš Vávra

The Kahane--Salem--Zygmund inequality for multilinear forms in $\ell_{\infty}$ spaces claims that, for all positive integers $m,n_{1},...,n_{m}$, there exists an $m$-linear form $A\colon\ell_{\infty}^{n_{1}}\times\cdots\times…

组合数学 · 数学 2021-11-04 Daniel Pellegrino , Anselmo Raposo

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

数论 · 数学 2026-05-26 Artyom Radomskii

It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…

逻辑 · 数学 2025-06-05 Mihai Prunescu

In this article, we develop an algorithm to calculate the set of all integers $m$ for which there exists a linear operator $T$ on ${\mathbb R}^n$ such that ${\mathbb R}^n$ has exactly $m$ $T$-invariant subspaces. A brief discussion is…

环与代数 · 数学 2012-01-17 Josh Ide , Lenny Jones