Related papers: Comment to "Almost disjoint sets, the dense set pr…

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

A short proof of a conjecture of Kropholler is given. This gives a relative version of Stallings' Theorem on the structure of groups with more than one end. A generalisation of the Almost Stability Theorem is also obtained, that gives…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…

Inconsistencies are pointed out in a recent proposal [L. Diosi, Phys. Rev. A 80, 064104 (2009); arXiv:0905.3908v1] for a quantum version of the classical linear Boltzmann equation.

This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…

The paper is concerned with the asymptotic analysis of a family of Boltzmann (multiplicative) distributions over the set $\check{\varLambda}^{q}$ of strict integer partitions (i.e., with unequal parts) into perfect $q$-th powers. A…

We establish the connection between the Steinitz problem for ordering vector families in arbitrary norms and its variant for not necessarily zero-sum families consisting of `nearly unit' vectors.

We prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give a affirmative answer to the analogue in this setting of a famous conjecture of…

We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.

The goal of this expository article is to present a proof that is as direct and elementary as possible of the fundamental theorem of complex multiplication (Shimura, Taniyama, Langlands, Tate, Deligne et al.). The article is a revision of…

The problem of partitioning a large and sparse tensor is considered, where the tensor consists of a sequence of adjacency matrices. Theory is developed that is a generalization of spectral graph partitioning. A best rank-$(2,2,\lambda)$…

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

In the article titled "Branching-Coalescing Particle Systems" published in Probability Theory and Related Fields 131(3), pages 376-414, (2005), Theorem 7 as stated there is incorrect. Indeed, we show by counterexample that the equality that…

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

This comment regards a central aspect of the referred-to paper, the issue of convergence of the large coordination-number expansion. Perturbation expansions of expressions containing a large number of parameters are generally invalid due to…

In recent years post-Newtonian approximations for isolated slowly-moving systems in general relativity have been studied by means of matched asymptotic expansions. A paper by Poujade & Blanchet in 2002 made great progress by effectively…

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

We study the optimization version of the set partition problem (where the difference between the partition sums are minimized), which has numerous applications in decision theory literature. While the set partitioning problem is NP-hard and…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…