We asymptotically analyse the volume-random variables of general, symmetric and cyclically symmetric plane partitions fitting inside a box. We consider the respective symmetry class equipped with theâ€¦ (More)

Prudent walks are self-avoiding walks on the square lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons,â€¦ (More)

We derive area limit laws for the various symmetry classes of staircase polygons on the square lattice, in a uniform ensemble where, for fixed perimeter, each polygon occurs with the sameâ€¦ (More)

We study limit distributions for random variables defined in terms of coefficients of a power series which is determined by a certain linear functional equation. Our technique combines the method ofâ€¦ (More)

Abstract: In this paper we illustrate some new ideas in the theory of l1âˆ’norm minimisation. A simple looking mathematical programming problem, namely the minimisation of the sum of the one norms ofâ€¦ (More)

The solution to a basic problem in time-invariant l1 optimal control is constructed in feedback form. Using ideas from dynamic programming and duality, we find the rule describing how, for optimal l1â€¦ (More)

We give a strongly polynomial time combinatorial algorithm to minimise the largest eigenvalue of the weighted Laplacian of a bipartite graph G = (W âˆªB,E). This is accomplished by solving the dualâ€¦ (More)

We provide strongly polynomial time combinatorial algorithms to minimize the largest eigenvalue of the weighted Laplacian of a bipartite graph and the weighted signless Laplacian of an arbitraryâ€¦ (More)