English
Related papers

Related papers: Shelah's partition functions and the Hales-Jewett …

200 papers

Vazirani and the author \cite{BV} gave a new interpretation of what we called $\ell$-partitions, also known as $(\ell,0)$-Carter partitions. The primary interpretation of such a partition $\lambda$ is that it corresponds to a Specht module…

Combinatorics · Mathematics 2011-07-20 Chris Berg

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…

Number Theory · Mathematics 2018-05-15 F. V. Weinstein

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

Number Theory · Mathematics 2024-01-09 Alfredo Nader

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…

Number Theory · Mathematics 2026-02-02 Hartosh Singh Bal , Gaurav Bhatnagar

In this paper we give an alternate combinatorial description of the "$(\ell,0)$-JM partitions" (see \cite{F}) that are also $\ell$-regular. Our main theorem is the equivalence of our combinatoric and the one introduced by James and Mathas…

Combinatorics · Mathematics 2011-07-20 Chris Berg , Monica Vazirani

In this paper, we study classes of subexcedant functions enumerated by the Bell numbers and present bijections on set partitions. We present a set of permutations whose transposition arrays are the restricted growth functions, thus defining…

Combinatorics · Mathematics 2022-08-23 Fufa Beyene , Jörgen Backelin , Roberto Mantaci , Samuel A. Fufa

We give an upper bound for the error term in the Hardy-Ramanujan-Rademacher formula for the partition function. The main input is a new hybrid subconvexity bound for the central value $L(\tfrac 12,f\times (\tfrac{q}{\cdot}))$ in the $q$ and…

Number Theory · Mathematics 2022-05-02 Nickolas Andersen , Han Wu

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

Number Theory · Mathematics 2019-07-17 Erin Bevilacqua , Kapil Chandran , Yunseo Choi

Consider the space $R_{\Delta}$ of rational functions of several variables with poles on a fixed arrangement $\Delta$ of hyperplanes. We obtain a decomposition of $R_{\Delta}$ as a module over the ring of differential operators with…

Differential Geometry · Mathematics 2007-05-23 Michel Brion , Michele Vergne

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

Machine Learning · Computer Science 2013-01-07 Martin Wainwright , Tommi S. Jaakkola , Alan Willsky

We give upper bounds on the Walsh coefficients of functions for which the derivative of order at least one has bounded variation of fractional order. Further, we also consider the Walsh coefficients of functions in periodic and non-periodic…

Functional Analysis · Mathematics 2013-04-04 Josef Dick

For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…

Combinatorics · Mathematics 2013-02-18 Suping Cui , Nancy Shanshan Gu

Let $\{w_{i,j}\}_{1\leq i\leq n, 1\leq j\leq s} \subset L_m=F(X_1,...,X_m)[{\partial \over \partial X_1},..., {\partial \over \partial X_m}]$ be linear partial differential operators of orders with respect to ${\partial \over \partial…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev

Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called {\em Sylvester waves}) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…

Number Theory · Mathematics 2007-05-23 Boris Y. Rubinstein , Leonid G. Fel

This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.

Nuclear Theory · Physics 2009-11-07 Pierre Desesquelles

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

Number Theory · Mathematics 2021-01-25 Zachary Hoelscher , Eyvindur Ari Palsson

Let A be a finite subset of an abelian group (G, +). Let h $\ge$ 2 be an integer. If |A| $\ge$ 2 and the cardinality |hA| of the h-fold iterated sumset hA = A + $\times$ $\times$ $\times$ + A is known, what can one say about |(h -- 1)A| and…

Commutative Algebra · Mathematics 2021-11-29 Shalom Eliahou , Eshita Mazumdar

This paper records some apparently new results for the partition of integer intervals [1, n] into weakly sum-free subsets. These were produced using a method closely related to that used by Schur in 1917. New lower bounds can be produced in…

Combinatorics · Mathematics 2021-06-10 Fred Rowley

For integers $n$ and $k$, the density Hales-Jewett number $c_{n,k}$ is defined as the maximal size of a subset of $[k]^n$ that contains no combinatorial line. We show that for $k \ge 3$ the density Hales-Jewett number $c_{n,k}$ is equal to…

Computational Complexity · Computer Science 2018-07-03 Adi Shraibman
‹ Prev 1 2 3 10 Next ›