相关论文: On a square-ice analogue of plane partitions

We conjecture that the asymptotic behavior of the numbers of solid (three-dimensional) partitions is identical to the asymptotics of the three-dimensional MacMahon numbers. Evidence is provided by an exact enumeration of solid partitions of…

We study random skew 3D partitions weighted by $q^{\textup{vol}}$ and, specifically, the $q\to 1$ asymptotics of local correlations near various points of the limit shape. We obtain sine-kernel asymptotics for correlations in the bulk of…

Accurate predictions of basal melt rates on ice shelves are necessary for precise projections of the future behaviour of ice sheets. The computational expense associated with completely resolving the cavity circulation using an ocean model…

Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.

We consider the partition function Z(N;x_1,...,x_N,y_1,...,y_N) of the square ice model with domain wall boundary. We give a simple proof of the symmetry of Z with respect to all its variables when the global parameter a of the model is set…

In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…

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…

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Recent work of Cesana, Craig and the third author shows that the trace of plane partitions is asymptotically equidistributed in residue classes mod $b$. Applying a technique of the first two authors and Garnowski, we prove asymptotic…

We revisit a formula for the number of plane partitions due to Almkvist. Using the circle method, we provide modifications to his formula along with estimates of the errors. We show that the improved formula continues to be an asymptotic…

A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis…

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…

Inspired by the works of Dewar, Murty and Kot\v{e}\v{s}ovec, we establish some useful theorems for asymptotic formulas. As an application, we obtain asymptotic formulas for the numbers of skew plane partitions and cylindric partitions. We…

We study the asymptotic behavior of piecewise constant least squares regression estimates, when the number of partitions of the estimate is penalized. We show that the estimator is consistent in the relevant metric if the signal is in…

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.

In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…

This paper concerns numerical assessment of Monte Carlo error in particle filters. We show that by keeping track of certain key features of the genealogical structure arising from resampling operations, it is possible to estimate variances…

The self-assembly of hard polyhedral particles confined to a flat interface is studied using Monte Carlo simulations. The particles are pinned to the interface by restricting their movement in the direction perpendicular to it while…

We study the asymptotic behavior of solid partitions using transition matrix Monte Carlo simulations. If $p_3(n)$ denotes the number of solid partitions of an integer $n$, we show that $\lim_{n\rightarrow\infty} n^{-3/4} \log p_3(n)\sim…