English
Related papers

Related papers: One-Dimensional Packing: Maximality Implies Ration…

200 papers

We investigate the list packing number of a graph, the least $k$ such that there are always $k$ disjoint proper list-colourings whenever we have lists all of size $k$ associated to the vertices. We are curious how the behaviour of the list…

Combinatorics · Mathematics 2024-11-20 Stijn Cambie , Wouter Cames van Batenburg , Ewan Davies , Ross J. Kang

We describe maximal, in a sense made precise, analytic continuations of germs at infinity of unary functions definable in the o-minimal structure R_an,exp on the Riemann surface of the logarithm. As one application, we give an upper bound…

Logic · Mathematics 2018-10-22 Tobias Kaiser , Patrick Speissegger

We show that any subgroup of a finitely generated virtually abelian group $G$ grows rationally relative to $G$, that the set of right cosets of any subgroup of $G$ grows rationally, and that the set of conjugacy classes of $G$ grows…

Group Theory · Mathematics 2019-09-12 Alex Evetts

For a radical extension K of odd prime degree the ring O_K of integers is constructed as a product of subrings with the following property: for all prime divisors q of the discriminant of O_K there is a q-maximal factor. The discriminant of…

Number Theory · Mathematics 2022-08-09 Julius Kraemer

The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…

Logic in Computer Science · Computer Science 2019-02-12 Mohsen Mansouri , Farzad Didehvar

We prove that for any fixed $n$, and for most permutation patterns $q$, the number $\textup{Av}_{n,\ell}(q)$ of $q$-avoiding permutations of length $n$ that consist of $\ell$ skew blocks is a monotone decreasing function of $\ell$. We then…

Combinatorics · Mathematics 2019-06-04 Miklós Bóna

Let $G$ be a finite group. A sequence over $G$ is a finite multiset of elements of $G$, and it is called product-one if its terms can be ordered so that their product is the identity of $G$. The large Davenport constant $\D(G)$ is the…

Group Theory · Mathematics 2025-10-03 Danilo Vilela Avelar , Fabio Enrique Brochero Martínez , Sávio Ribas

We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action…

Rings and Algebras · Mathematics 2022-06-06 Becky Armstrong , Lisa Orloff Clark , Astrid an Huef , Malcolm Jones , Ying-Fen Lin

The present paper studies the limiting behavior of the average score of a sequentially selected group of items or individuals, the underlying distribution of which, $F$, belongs to the Gumbel domain of attraction of extreme value…

Probability · Mathematics 2010-11-16 Abba M. Krieger , Moshe Pollak , Ester Samuel-Cahn

In a set equipped with a binary operation, (S,*), a subset U is defined to be avoidable if there exists a partition {A,B} of S such that no element of U is the product of two distinct elements of A or of two distinct elements of B. For more…

Combinatorics · Mathematics 2007-05-23 Mike Develin

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

Combinatorics · Mathematics 2007-05-23 M. Albert , M. D. Atkinson , N. Ruskuc

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

Combinatorics · Mathematics 2016-10-24 Julian Sahasrabudhe

Julia Robinson has given a first-order definition of the rational integers $\mathbb Z$ in the rational numbers $\mathbb Q$ by a formula $(\forall \exists \forall \exists)(F=0)$ where the $\forall$-quantifiers run over a total of 8…

Logic · Mathematics 2008-02-14 Gunther Cornelissen , Alexandra Shlapentokh

We consider general discrete-time multitype branching processes on a countable set $X$. According to these processes, a particle of type $x\in X$ generates a random number of children and chooses their type in $X$, not necessarily…

Probability · Mathematics 2025-07-28 Daniela Bertacchi , Fabio Zucca

We create mechanically stable (MS) packings of bidisperse disks using an algorithm in which we successively grow or shrink soft repulsive disks followed by energy minimization until the overlaps are vanishingly small. We focus on small…

Statistical Mechanics · Physics 2009-11-11 Guo-Jie Gao , Jerzy Blawzdziewicz , Corey S. O'Hern

Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…

Number Theory · Mathematics 2023-09-15 Joel Louwsma , Joseph Martino

Much recent work has shown how cross-linguistic variation is constrained by competing pressures from efficient communication. However, little attention has been paid to the role of the systematicity of forms (regularity), a key property of…

Computation and Language · Computer Science 2026-02-03 Ponrawee Prasertsom , Andrea Silvi , Jennifer Culbertson , Moa Johansson , Devdatt Dubhashi , Kenny Smith

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

Higher dimensional permutations are tuples of d-1 permutations that can be identified with a point set in a d-dimensional grid. In N. Bonichon and P.-J. Morel, {\it J. Integer Sequences} 25 (2022), several conjectures regarding the…

Combinatorics · Mathematics 2026-05-21 Thomas Muller

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral
‹ Prev 1 8 9 10 Next ›