English
Related papers

Related papers: Compositions colored by simplicial polytopic numbe…

200 papers

The transversal ratio of a polytope $P$ is the minimum proportion of vertices of $P$ required to intersect each facet of $P$. The weak chromatic number of $P$ is the minimum number of colors required to color the vertices of $P$ so that no…

Combinatorics · Mathematics 2026-03-18 Michael Gene Dobbins , Seunghun Lee

Agarwal introduced $n$-color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colors. After three general results, giving recurrence formulas…

Combinatorics · Mathematics 2021-08-24 Brian Hopkins , Hua Wang

We construct coherent states using sequences of combinatorial numbers such as various binomial and trinomial numbers, and Bell and Catalan numbers. We show that these states satisfy the condition of the resolution of unity in a natural way.…

Quantum Physics · Physics 2017-08-23 Karol A. Penson , Allan I Solomon

There exists a minimum integer $N$ such that any 2-coloring of $\{1,2,...,N\}$ admits a monochromatic solution to $x+y+kz =\ell w$ for $k,\ell \in \mathbb{Z}^+$, where $N$ depends on $k$ and $\ell$. We determine $N$ when $\ell-k \in…

Combinatorics · Mathematics 2007-07-02 Aaron Robertson , Kellen Myers

We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…

Combinatorics · Mathematics 2024-03-05 Ricardo Gómez Aíza

We review the combinatorial, topological, algebraic and metric properties supported by $(D+1)$-colored graphs, with a focus on those that are pertinent to the study of tensor model theories. We show how to extract a limiting continuum…

Combinatorics · Mathematics 2016-08-03 James P. Ryan

We address partition regularity problems for homogeneous quadratic equations. A consequence of our main results is that, under natural conditions on the coefficients $a,b,c$, for any finite coloring of the positive integers, there exists a…

Combinatorics · Mathematics 2024-08-08 Nikos Frantzikinakis , Oleksiy Klurman , Joel Moreira

The first step in investigating colour symmetries for periodic and aperiodic systems is the determination of all colouring schemes that are compatible with the symmetry group of the underlying structure, or with a subgroup of it. For an…

Combinatorics · Mathematics 2007-05-23 Michael Baake , Uwe Grimm

In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Number Theory · Mathematics 2011-06-03 Zhi-Wei Sun , Roberto Tauraso

Random tensor models are generalizations of matrix models which also support a 1/N expansion. The dominant observables are in correspondence with some trees, namely rooted trees with vertices of degree at most $D$ and lines colored by a…

Mathematical Physics · Physics 2012-06-20 Valentin Bonzom , Razvan Gurau

Given an $n$-vertex graph $G$ and two positive integers $d,k \in \mathbb{N}$, the ($d,kn$)-differential coloring problem asks for a coloring of the vertices of $G$ (if one exists) with distinct numbers from 1 to $kn$ (treated as…

Discrete Mathematics · Computer Science 2014-10-03 Michael Bekos , Stephen Kobourov , Michael Kaufmann , Sankar Veeramoni

Let $P(x)$ be a polynomial of degree $m$, with nonnegative and non-decreasing coefficients. We settle the conjecture that for any positive real number $d$, the coefficients of $P(x+d)$ form a unimodal sequence, of which the special case $d$…

Combinatorics · Mathematics 2008-09-10 Yi Wang , Yeong-Nan Yeh

In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient. The number of all generalized compositions of a natural number is a weighted…

Combinatorics · Mathematics 2010-09-17 Milan Janjic

Let $S$ be an orthogonal array $OA(d,k)$ and let $c$ be an $r$--coloring of its ground set $X$. We give a combinatorial identity which relates the number of vectors in $S$ with given color patterns under $c$ with the cardinalities of the…

Combinatorics · Mathematics 2011-04-04 Amanda Montejano , Oriol Serra

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

Number Theory · Mathematics 2011-03-25 Victor J. W. Guo , Jiang Zeng

Let $d \ge 3$ be an integer. We show that whenever an order-$d$ tensor admits $d+1$ decompositions according to Tao's slice rank, if the linear subspaces spanned by their one-variable functions constitute a sunflower for each choice of…

Combinatorics · Mathematics 2023-08-15 Thomas Karam

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…

Combinatorics · Mathematics 2010-09-15 Kruchinin Vladimir Victorovich

Within the framework of unitary easy quantum groups, we study an analogue of Brauer's Schur-Weyl approach to the representation theory of the orthogonal group. We consider concrete combinatorial categories whose morphisms are formed by…

Combinatorics · Mathematics 2019-01-11 Alexander Mang , Moritz Weber

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

Number Theory · Mathematics 2022-12-01 Bartosz Sobolewski , Maciej Ulas

We describe all the Bier spheres of dimension $d$ with chromatic number equal to $d+1$ and prove that all other $d$-dimensional Bier spheres have chromatic number equal to $d+2$, for any integer $d\geq 0$. Then we prove a general formula…

Combinatorics · Mathematics 2026-02-17 Ivan Limonchenko , Aleš Vavpetič