相关论文: A note on triangle partitions
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…
Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…
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.
We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').
In the covariant canonical approach to classical physics, each point in phase space represents an entire classical trajectory. Initial data at a fixed time serve as coordinates for this ``timeless'' phase space, and time evolution can be…
In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
Identifying an appropriate set of ``observables'' is a nontrivial task for most approaches to quantum gravity. We describe how it may be accomplished in the context of a recently proposed family of stochastic (but classical) dynamical laws…
In this paper we explore Kruyswijk's method and show how to obtain congruences for cubic partition. That apart we also examine inequalities for a(n) and provide upper bound for it in the fashion of the classic partition function p(n).
In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods…
We study the geometry and codes of quartic surfaces with many cusps. We apply Gr\"obner bases to find examples of various configurations of cusps on quartics.
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
This manuscript is intended as an accompaniment to Guth's "A restriction estimate using polynomial partitioning". We begin by summarizing the core ideas of the proof, elaborating the history and development of the techniques therein. From…
If A is infinite and well-ordered, then |2^A|<=|Part(A)|<=|A^A|.
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In…
In a recent paper by the author, a new approach was suggested for quantising space-time, or space. This involved developing a procedure for quantising a system whose configuration space--or history-theory analogue--is the set of objects in…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…