Titlebook: Combinatorial and Additive Number Theory IV; CANT, New York, USA, Melvyn B. Nathanson Conference proceedings 2021 The Editor(s) (if applica

Corroborate

brother

Gang Qian,Jiqing Zhang,Assegid Kidanénce, we find the sequences counting multicompositions with analogous restrictions. With these tools, we give combinatorial proofs of summation formulas for generalizations of the Jacobsthal and Pell sequences.

facilitate

文字

Extremal Sequences for Some Weighted Zero-Sum Constants for Cyclic Groups,so been found. After some introductory remarks, we here take up some questions regarding inverse problems related to the values of a weighted zero-sum constant for some particular weights for a finite cyclic group.

Constrain

Infinite Co-minimal Pairs in the Integers and Integral Lattices,al pairs is a stronger criterion than the existence of minimal complements. In this work, we show several new results about them. The existence and the construction of co-minimal pairs in the integers, with both the subsets . and . (. is not a translate of .) of infinite cardinality was unknown. We

Meditate

Rigidity, Graphs and Hausdorff Dimension,iven a compact subset . of ., . of Hausdorff dimension greater than . we prove that the Lebesgue measure of noncongruent .-point configurations in . is positive, for ., complementing the results of [.] for ..

冰河期

On Generalized Harmonic Numbers,tor of . In this paper, we prove that for two coprime positive integers . and ., (i) if . is a prime with ., then the set of positive integers . with . has asymptotic density one; (ii) the set of positive integers . with . has asymptotic density one.

歪曲道理

Gnrh670

Representing Sequence Subsums as Sumsets of Near Equal Sized Sets,ome .-term subsequence of .. When the subsum set is very small, ., it is known that the terms of . can be partitioned into . nonempty sets . such that .. Moreover, if the upper bound is strict, then . for all ., where . and . is the stabilizer of .. This allows structural results for sumsets to be u

invade

Bounds on Point Configurations Determined by Distances and Dot Products,e point set. Specifically, given a large finite set of . points ., we look for bounds on how many subsets of . points satisfy a set of relationships between point pairs based on distances or dot products. We survey some of the recent work in the area and present several new, more general families of