English
Related papers

Related papers: Germ order for one-dimensional packings

200 papers

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…

Combinatorics · Mathematics 2021-09-22 Jonathan Jedwab , Shuxing Li

The optimal packings of n unit discs in the plane are known for those natural numbers n, which satisfy certain number theoretic conditions. Their geometric realizations are the extremal Groemer packings (or Wegner packings). But an extremal…

Combinatorics · Mathematics 2011-06-14 Dominik Kenn

A set of vertices $X\subseteq V(G)$ is a $d$-distance dominating set if for every $u\in V(G)\setminus X$ there exists $x\in X$ such that $d(u,x) \le d$, and $X$ is a $p$-packing if $d(u,v) \ge p+1$ for every different $u,v\in X$. The…

Combinatorics · Mathematics 2025-08-21 Csilla Bujtás , Vesna Iršič Chenoweth , Sandi Klavžar , Gang Zhang

Ranking over sets arise when users choose between groups of items. For example, a group may be of those movies deemed $5$ stars to them, or a customized tour package. It turns out, to model this data type properly, we need to investigate…

Machine Learning · Computer Science 2014-08-04 Truyen Tran , Dinh Phung , Svetha Venkatesh

We show that, for any fixed genus $g$, the ordinary generating function for the genus $g$ partitions of an $n$-element set into $k$ blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a…

Combinatorics · Mathematics 2017-10-30 Robert Cori , Gábor Hetyei

Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…

Combinatorics · Mathematics 2020-07-03 Çağın Ararat , Ülkü Gürler , M. Emrullah Ildız

We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…

Group Theory · Mathematics 2023-08-16 Koji Fujiwara , Zlil Sela

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

A disordered solid, such as an athermal jammed packing of soft spheres, exists in a rugged potential-energy landscape in which there are a myriad of stable configurations that defy easy enumeration and characterization. Nevertheless, in…

Soft Condensed Matter · Physics 2024-03-26 Varda F. Hagh , Sidney R. Nagel

Every conditionally convergent series of real numbers has a subseries that diverges. The subseries numbers, previously studied in arXiv:1801.06206 , answer the question how many subsets of the natural numbers are necessary, such that every…

Logic · Mathematics 2025-08-05 Tristan van der Vlugt

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Number Theory · Mathematics 2021-02-12 Ron Brown

We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three…

Combinatorics · Mathematics 2010-09-24 William Y. C. Chen , Neil J. Y. Fan , Alina F. Y. Zhao

For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…

Number Theory · Mathematics 2016-08-22 Sándor Z. Kiss , Csaba Sándor

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Logic · Mathematics 2007-05-23 David Marker , Theodore A. Slaman

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…

Data Structures and Algorithms · Computer Science 2019-10-10 Giulio Cerbai , Lapo Cioni , Luca Ferrari

The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…

Logic · Mathematics 2019-05-17 Ruadhan O'Flanagan

For any constant $C_0>0$, we construct a set $A \subset {\mathbb N}$ such that one has $$ \sum_{n \in A: n \leq x} \frac{1}{n} = \exp\left(\left(\frac{C_0}{2}+o(1)\right) (\log\log x)^{1/2} \log\log\log x \right)$$ and $$ \sum_{n,m \in A:…

Number Theory · Mathematics 2025-11-12 Terence Tao

We study the classification problem of singularities of function-germs with harmonic leading terms of two variables under the right-equivalence. We study the classification in the cases that the order of function-germs is at most 7.…

Differential Geometry · Mathematics 2015-11-24 Yuki Yasuda

An explanation is given for the initially surprising ubiquity of separating sets in normal complex surface germs. It is shown that they are quite common in higher dimensions too. The relationship between separating sets and the geometry of…

Algebraic Geometry · Mathematics 2011-07-29 Lev Birbrair , Alexandre Fernandes , Walter D Neumann

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

Classical Analysis and ODEs · Mathematics 2024-09-23 Jonathan M. Fraser