English
Related papers

Related papers: On m-covers and m-systems

200 papers

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let representation function $R_{A}(\overline{n})$ denote the number of…

Number Theory · Mathematics 2020-07-01 Cui-Fang Sun , Meng-Chi Xiong

For integers $n,k,s$, we give a formula for the number $T(n,k,s)$ of order $k$ subsets of the ring $\mathbb{Z}/n\mathbb{Z}$ whose sum of elements is $s$ modulo $n$. To do so, we describe explicitly a sequence of matrices $M(k)$, for…

Number Theory · Mathematics 2025-03-21 David Broadhurst , Xavier Roulleau

The feedback class of a locally Brunovsky linear system is fully determined by the decomposition of state space as direct sum of system invariants [4]. In this paper we attack the problem of enumerating all feedback classes of locally…

Commutative Algebra · Mathematics 2015-02-03 Miguel V. Carriegos , Noemí DeCastro-García

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

Number Theory · Mathematics 2011-01-26 Zhi-Wei Sun , Wei Zhang

We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…

Number Theory · Mathematics 2011-07-15 Geoffrey Iyer , Oleg Lazarev , Steven J. Miller , Liyang Zhang

If $s$ is a positive integer and $A$ is a set of positive integers, we say that $B$ is an $s$-divisor of $A$ if $\sum_{b\in B} b\mid s\sum_{a\in A} a$. We study the maximal number of $k$-subsets of an $n$-element set that can be…

Combinatorics · Mathematics 2015-05-21 Samuel Zbarsky

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

Number Theory · Mathematics 2018-08-23 Hung Chu , Nathan McNew , Steven J. Miller , Victor Xu , Sean Zhang

Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest…

Number Theory · Mathematics 2021-11-11 Lu Cui , Minghui Ma

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

Group Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the…

Number Theory · Mathematics 2022-08-17 Cui-Fang Sun , Hao Pan

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Combinatorics · Mathematics 2026-04-29 Alexander Povolotsky

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

Number Theory · Mathematics 2007-08-06 Zhi-Wei Sun , Roberto Tauraso

Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…

Combinatorics · Mathematics 2017-06-21 I. Bárány , E. Csóka , Gy. Károlyi , G. Tóth

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

Number Theory · Mathematics 2019-06-14 Thai Hoang Le , Julia Wolf

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let $R_{A}(\overline{n})$ denote the number of solutions of…

Number Theory · Mathematics 2020-07-02 Cui-Fang Sun , Meng-Chi Xiong

Given a cycle module M with a ring structure we show that the cycle complex with coefficients in M of a smooth scheme of finite type over a field has a A-infinity algebra structure. In the case of Milnor K-theory this gives a homotopy model…

Algebraic Geometry · Mathematics 2009-06-30 Florian Ivorra

We construct an infinite family of real cyclotomic fields with non-trivial class group. This result generalizes the result in [1] in the sense that our family includes theirs.

Number Theory · Mathematics 2022-05-17 Om Prakash

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Formal Languages and Automata Theory · Computer Science 2013-10-28 Artur Jeż , Alexander Okhotin

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

Combinatorics · Mathematics 2007-05-23 Edwin O'Shea