Related papers: Square Partitions and Catalan Numbers
The ECO method and the theory of Catalan-like numbers introduced by Aigner seems two completely unrelated combinatorial settings. In this work we try to establish a bridge between them, aiming at starting a (hopefully) fruitful study on…
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…
There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions…
Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…
We consider a family of integer linear programs in which the coefficients of the constraints and objective function are polynomials of an integer parameter $t.$ For $\ell$ in $\mathbb{Z}_+,$ we define $f_\ell(t)$ to be the…
In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…
A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…
We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\subseteq V$ of size $k$, such that $\alpha_1m_1 + \alpha_2m_2$ is at most (or at…
Solving optimization problems is a key task for which quantum computers could possibly provide a speedup over the best known classical algorithms. Particular classes of optimization problems including semi-definite programming (SDP) and…
We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…
A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…
We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…
We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for…
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…
A $k \times n$ partial Latin rectangle is \textit{$C$-sparse} if the number of nonempty entries in each row and column is at most $C$ and each symbol is used at most $C$ times. We prove that the probability a uniformly random $k \times n$…
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…
We give an elementary proof of a well-known result on Kostka numbers, following a question from Mark Wildon on MathOverflow. Namely, we show that given partitions $\lambda,\mu,\nu$ of $n$ with $\mu\trianglerighteq\nu$, we have…
In this paper we investigate the optimal partition approach for multiparametric conic linear optimization (mpCLO) problems in which the objective function depends linearly on vectors. We first establish more useful properties of the…
We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm…