Related papers: Automated counting of LEGO towers
We present a new method to count unrooted maps on the sphere up to orientation-preserving homeomorphisms. The principle, called tree-decomposition, is to deform a map into an arborescent structure whose nodes are occupied by constrained…
We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation…
We consider Milnor's "tower algorithm" in the space of piecewise monotone maps, an iterative algorithm on the space of metrics which unifies, on the one hand, Thurston's iterative scheme which converges to holomorphic models, and, on the…
We generalize methods to compute various kinds of rank to the case of a toric variety $X$ embedded into projective space using a very ample line bundle $\mathcal{L}$. We find an upper bound on the cactus rank. We use this to compute rank,…
Determining the number of pieces after cutting a cake is a classical problem. Roberts (1887) provided an exact solution by computing the number of chambers contained in a plane cut by lines. About 88 years later, Zaslavsky (1975) even…
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some…
An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…
We establish several asymptotic formulae and upper bounds for the count of multiplicatively dependent integer vectors that lie on a fixed hyperplane and have bounded height. This work constitutes a direct extension of the results obtained…
The brilliant idea of Jean Betrema and Jean-Guy Penaud that proved the celebrated "three to the power n" theorem of Dominique Gouyou-Beauchamps and Xavier Viennot, counting towers of domino pieces is extended and used to enumerate much more…
We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…
Given a collection of points in the plane, classifying which subsets are collinear is a natural problem and is related to classical geometric constructions. We consider collections of points in a projective plane over a finite field such…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
In this note we compute some enumerative invariants of real and complex projective spaces by means of some enriched graphs called floor diagrams.
This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and…
I describe an empirical-yet-rigorous, algorithm, based on Riordan's rook polynomials and the so-called C-finite ansatz, fully implemented in the accompanying Maple package (http://www.math.rutgers.edu/~zeilberg/tokhniot/MENAGES ), MENAGES,…
Dyck paths are one of the most important objects in enumerative combinatorics, and there are many papers devoted to counting selected families of Dyck paths. Here we present two approaches for the automatic counting of many such families,…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
Projective Hjelmslev planes and Affine Hjelmselv planes are generalisations of projective planes and affine planes. We present an algorithm for constructing a projective Hjelmslev planes and affine Hjelsmelv planes using projective planes,…