English
Related papers

Related papers: Polynomial analogues of restricted multicolor b-ar…

200 papers

Let $f$ be a polynomial with integer coefficients such that $f(n)$ positive for any positive integer $n$. We consider diverging sequences $\{ y_n\}$ given by $y_0 = b$ and $y_{n+1} = f^{y_n}(a)$ with positive integers $a$ and $b$. We show…

Number Theory · Mathematics 2022-11-30 Rin Gotou

For $r:=(r_1,\dots,r_k)$, an $r$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of (the edges of) $\lambda K_n^h$ into $F_1,\dots, F_k$ such that for $i=1,\dots,k$, $F_i$ is…

Combinatorics · Mathematics 2022-09-15 Amin Bahmanian , Anna Johnsen

Given relatively prime positive integers, $a_1,\ldots,a_n$, the Frobenius number is the largest integer with no representations of the form $a_1x_1+\cdots+a_nx_n$ with nonnegative integers $x_i$. This classical value has recently been…

Combinatorics · Mathematics 2023-08-21 Kevin Woods

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

Computational Complexity · Computer Science 2014-04-08 Kousha Etessami , Alistair Stewart , Mihalis Yannakakis

In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…

Data Structures and Algorithms · Computer Science 2022-12-19 Viresh Patel , Guus Regts

Using a sums of squares formula for two variable polynomials with no zeros on the bidisk, we are able to give a new proof of a representation for distinguished varieties. For distinguished varieties with no singularities on the two-torus,…

Complex Variables · Mathematics 2013-02-06 Greg Knese

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Number Theory · Mathematics 2011-12-30 Vladimir Shevelev , Peter J. C. Moses

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

Combinatorics · Mathematics 2021-08-17 Fumio Hazama

In this article, we study the arithmetic properties of the partition function $p_8(n)$, the number of 8-colour partitions of $n$. We prove several Ramanujan type congruences modulo higher powers of 2 for the function $p_8(n)$ by finding…

Number Theory · Mathematics 2019-06-25 B. Hemanthkumar , H. S. Sumanth Bharadwaj

In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an…

Combinatorics · Mathematics 2018-02-22 S. Robins , C. Vignat

Let $\mathcal{P}$ be a graph property. A $\mathcal{P}$-coloring with at most $k$ colors is a coloring of the vertices of a simple graph $G$ such that each color class induces a graph in $\mathcal{P}$. Harary polynomials are generalizations…

Combinatorics · Mathematics 2025-12-30 Johann A. Makowsky

In this work, we investigate the arithmetic properties of $p_{1,7^k}(n)$, which counts 2-color partitions of $n$ where one of the colors appears only in parts that are multiples of $7^k$. By constructing generating functions for…

Number Theory · Mathematics 2025-04-03 D. S. Gireesh , Shivashankar C. , HemanthKumar B

Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…

High Energy Physics - Theory · Physics 2009-10-28 Omar Foda , Yas-Hiro Quano

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

A well-known consequence of Schur's theorem is that for $r\in \mathbb{N}$, if $n$ is sufficiently large, then any $r$-colouring of $[n]$ results in monochromatic $a,b,c\in [n]$ such that $ab=c$. In this paper we are interested in the…

Combinatorics · Mathematics 2026-01-15 Roger Lidón , Darío Martínez , Patrick Morris , Miquel Ortega

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

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

Combinatorics · Mathematics 2017-11-09 Lisa Hui Sun , Mingzhi Zhang

The introduction of bars in-between blocks of an ordered set partition(preferential arrangement) results in a barred ordered set partition(barred preferential arrange- ment). Having the restriction that some blocks of barred preferential…

Combinatorics · Mathematics 2015-09-25 S. Nkonkobe , V. Murali

Suppose that $\mathbb{F}_p$ is coloured with $r$ colours. Then there is some colour class containing at least $c_r p^2$ quadruples of the form $(x, y , x + y, xy)$.

Number Theory · Mathematics 2018-11-05 Ben Green , Tom Sanders