Related papers: Bounds on the Number of Graphical Partitions
We obtain partition regularity results for homogeneous quadratic equations whose parametrized solutions admit nice factorizations into linear forms over rings of integers of imaginary quadratic fields. To do so, we develop number-theoretic…
Given a graph $G$ and a non trivial partition $(V_1,V_2)$ of its vertex-set, the satisfaction of a vertex $v\in V_i$ is the ratio between the size of it's closed neighborhood in $V_i$ and the size of its closed neighborhood in $G$. The…
The Unfriendly Partition Problem asks whether it is possible to split the vertex set of an infinite graph $G$ into two parts so that every vertex has at least as many neighbors in the other part than on its own. Despite the uncountable…
Let $k$ and $n$ be positive integers. Let $c\phi_{k}(n)$ denote the number of $k$-colored generalized Frobenius partitions of $n$ and $\mathrm{C}\Phi_k(q)$ be the generating function of $c\phi_{k}(n)$. In this article, we study…
We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.
We present a different way to obtain generators of metric spaces having the property that the ``position'' of every element of the space is uniquely determined by the distances from the elements of the generators. Specifically we introduce…
We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. In part I, we studied the behavior of coefficients in the partial fraction decomposition of this…
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary…
In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors.
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…
In this paper we present a generating function approach to two counting problems in elementary quantum mechanics. The first is to find the total ways of distributing identical particles among different states. The second is to find the…
Amdeberhan conjectured that the number of $(t,t+1, t+2)$-core partitions is $\sum_{0\leq k\leq [\frac{t}{2}]}\frac{1}{k+1}\binom{t}{2k}\binom{2k}{k}$. In this paper, we obtain the generating function of the numbers $f_t$ of $(t, t + 1, ...,…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…
Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
In 1984, Andrews introduced the family of partition functions \(c\phi_k(n)\), which counts the number of generalized Frobenius partitions of \(n\) with \(k\) colors. In previous work, we proved a conjecture on congruences for \(c\phi_6(n)\)…