Related papers: Automated counting of LEGO towers
The number of distinguishable inherent structures of a liquid is the key component to understanding the thermodynamics of glass formers. In the case of hard potential systems such as hard discs, spheres and ellipsoids, an inherent structure…
An $n$ arc in $(k-1)$-dimensional projective space is a set of $n$ points so that no $k$ lie on a hyperplane. In 1988, Glynn gave a formula to count $n$-arcs in the projective plane in terms of simpler combinatorial objects called…
In this paper we derive a simple and useful combinatorial formula for the push-forwards of cohomology classes down projective towers, in terms of the push-forwards down the individual steps in the tower.
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…
Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object should be random with respect to image distribution if and only…
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.
A new method to perform numerical simulations of light-front Hamiltonians formulated on transverse lattices is introduced. The method is based on a DLCQ formulation for the (continuous) longitudinal directions. The hopping term in the…
We use symplectic techniques to obtain partial results on Mahler's conjecture about the product of the volume of a convex body and the volume of its polar. We confirm the conjecture for hyperplane sections or projections of $\ell_p$-balls…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
A simple procedure to obtain complete, closed expressions for Lie algebra invariants is presented. The invariants are ultimately polynomials in the group parameters. The construction of finite group elements require the use of projectors,…
The purpose of this paper is to generalize the classical Mazur's lemma from the classical convex analysis to the framework of locally $L^0$-convex modules. In this version an extra condition of countable concatenation is included. We…
We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter…
The classical problem of computing a complete system of Stokes multipliers of a linear system of ODEs of rank one in terms of some connection coefficients of an associated hypergeometric system of ODEs, is solved with no genericness…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
Back in the early days of polyomino enumeration, a model called column-convex polyominoes was introduced and its area generating function was found. That generating function is rational: the numerator has degree four and the denominator has…
Realization by linear vector fields is constructed for any Lie algebra which admits a biorthogonal system and for its any suitable representation. The embedding into Lie algebras of linear vector fields is analogous to the classical…
Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of…
For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…