Related papers: Meinardus' theorem on weighted partitions: extensi…

For any abelian group $A$, we prove an asymptotic formula for the number of $A$-extensions $K/\mathbb{Q}$ of bounded discriminant such that the associated norm one torus $R_{K/\mathbb{Q}}^1 \mathbb{G}_m$ satisfies weak approximation. We are…

We study the existence of the product of two weighted modulation spaces. For this purpose we discuss two different strategies. The more simple one allows transparent proofs in various situations. However, our second method allows a closer…

In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…

The graphs induced by partition logics allow a dual probabilistic interpretation: a classical one for which probabilities lie on the convex hull of the dispersion-free weights, and another one, suggested independently from the quantum Born…

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

In a previous paper, the author gave a combinatorial proof and refinement of Siladi\'c's theorem, a Rogers-Ramanujan type partition identity arising from the study of Lie algebras. Here we use the basic idea of the method of weighted words…

In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…

Linear systems with many degrees of freedom containing multiplicative and additive noise are considered. The steady state probability distribution for equations of this kind is examined. With multiplicative white noise it is shown that…

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

A combinatorial formula is derived which expresses free cumulants in terms of classical comulants. As a corollary, we give a combinatorial interpretation of free cumulants of classical distributions, notably Gaussian and Poisson…

We classify irreducible representations of the special linear groups in positive characteristic with small weight multiplicities with respect to the group rank and give estimates for the maximal weight multiplicities. For the natural…

Let G be a torus and M a G-Hamiltonian manifold with Kostant line bundle L and proper moment map. Let P be the weight lattice of G. We consider a parameter k and the multiplicity $m(\lambda,k)$ of the quantized representation associated to…

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…

This thesis is divided into three parts. The first part deals with cylindric plane partitions. The second with lambda-determinants and the third with commutators in semi-circular systems. For more detailed abstract please see inside.…

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…