English
Related papers

Related papers: Fraenkel's Partition and Brown's Decomposition

200 papers

Consider a bounded-degree graph $G$ that belongs to a minor-closed family (such as planar graphs). Such a graph has a hyperfinite decomposition, wherein, for a sufficiently small $\varepsilon > 0$, one can remove $\varepsilon dn$ edges to…

Data Structures and Algorithms · Computer Science 2026-05-25 Akash Kumar , Abhiruk Lahiri , C. Seshadhri

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Number Theory · Mathematics 2025-05-30 Dohoon Choi , Youngmin Lee

We give an explicit formula for the effective partition function of a harmonically bound particle minimally coupled to a photon field in the dipole approximation. The effective partition function is shown to be the Laplace transform of a…

Mathematical Physics · Physics 2015-05-18 Volker Betz , Domenico Castrigiano

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

Combinatorics · Mathematics 2016-08-16 J. Tharrats

We find general solutions to the generating-function equation sum c_q^{(X)} z^q = F(z)^X, where X is a complex number and F(z) is a convergent power series with |F(0)| >0. We then use these results to derive finite expressions containing…

Number Theory · Mathematics 2011-05-25 Jerome Malenfant

We consider sequences counting integer partitions in two colors (red and blue) in which the even parts occur only in blue color. We focus on subsequences defined by constraints on the parity and color of the summands. We establish formulas…

Number Theory · Mathematics 2026-05-25 George E. Andrews , Mohamed El Bachraoui

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Number Theory · Mathematics 2025-09-29 A. David Christopher

By jagged partitions we refer to an ordered collection of non-negative integers $(n_1,n_2,..., n_m)$ with $n_m\geq p$ for some positive integer $p$, further subject to some weakly decreasing conditions that prevent them for being genuine…

Combinatorics · Mathematics 2007-05-23 J. -F. Fortin , P. Jacob , P. Mathieu

Let $F(x)=(f_1(x), \dots, f_m(x))$ be such that $1, f_1, \dots, f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory…

Combinatorics · Mathematics 2018-11-20 Mohammad Bardestani , Keivan Mallahi-Karai

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

Combinatorics · Mathematics 2021-03-08 Matthieu Latapy , Thi Ha Duong Phan

We study partitions of totally positive integers in real quadratic fields. We develop an algorithm for computing the number of partitions, prove a result about the parity of the partition function, and characterize the quadratic fields such…

Number Theory · Mathematics 2023-10-17 David Stern , Mikuláš Zindulka

We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…

Logic · Mathematics 2023-12-05 Nattapon Sonpanow , Pimpen Vejjajiva

The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…

Logic · Mathematics 2024-06-04 Sandra Müller

Fundamental particles, regarded as the constituents of quarks and leptons, are described classicaly in the framework of the Weyl-Dirac version of Wesson's Induced Matter Theory. There are neutral particles and particles having charge…

General Relativity and Quantum Cosmology · Physics 2008-12-18 Mark Israelit

We develop some theory of spinal decompositions of discrete and continuous fragmentation trees. Specifically, we consider a coarse and a fine spinal integer partition derived from spinal tree decompositions. We prove that for a…

Probability · Mathematics 2009-08-27 Bénédicte Haas , Jim Pitman , Matthias Winkel

We show that cylindric partitions are in one-to-one correspondence with a pair which has an ordinary partition and a colored partition into distinct parts. Then, we show the general form of the generating function for cylindric partitions…

Combinatorics · Mathematics 2023-09-01 Kağan Kurşungöz , Halime Ömrüuzun Seyrek

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Combinatorics · Mathematics 2018-11-21 Kedar Karhadkar

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

Number Theory · Mathematics 2015-12-10 Maciej Gawron

Recently, Rattan and the first author (Ann. Comb. 25 (2021) 697-728) proved a conjectured inequality of Berkovich and Uncu (Ann. Comb. 23 (2019) 263-284) concerning partitions with an impermissible part. In this article, we generalize this…

Combinatorics · Mathematics 2022-12-01 Damanvir Singh Binner , Neha Gupta , Manoj Upreti

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

Combinatorics · Mathematics 2010-10-14 William J. Keith