Related papers: Lotuses as computational architectures
An effort has been made to show mathematicians some new ideas applied to image analysis. Gray images are presented as tilings. Based on topological properties of the tiling, a number of gray convex hulls: maximal, minimal, and oriented ones…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Diffusion limited aggregation is studied from the perspective of computational complexity. A parallel algorithm is exhibited that requires a number of steps that scales as the depth of the tree defined by the cluster. The existence of this…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
We present an abstract unifying framework for interpreting Stone-type dualities; several known dualities are seen to be instances of just one topos-theoretic phenomenon, and new dualities are introduced. In fact, infinitely many new…
A lattice model of critical dense polymers is solved exactly for arbitrary system size on the torus. More generally, an infinite family of lattice loop models is studied on the torus and related to the corresponding Fortuin-Kasteleyn random…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…
The lattice cohomology of a reduced curve singularity is a bigraded ${\mathbb Z}[U]$-module ${\mathbb H}^*=\oplus_{q,n}{\mathbb H}^q_{2n}$, that categorifies the $\delta$-invariant and extract key geometric information from the semigroup of…
The LASSO is an attractive regularisation method for linear regression that combines variable selection with an efficient computation procedure. This paper is concerned with enhancing the performance of LASSO for square-free hierarchical…
Curves are essential concepts that enable compounded aesthetic curves, e.g., to assemble complex silhouettes, match a specific curvature profile in industrial design, and construct smooth, comfortable, and safe trajectories in vehicle-robot…
A classic problem in computational biology is constructing a phylogenetic tree given a set of distances between n species. In most cases, a tree structure is too constraining. We consider a circular split network, a generalization of a tree…
For natural and artificial systems with some symmetry structure, computational understanding and manipulation can be achieved without learning by exploiting the algebraic structure. Here we describe this algebraic coordinatization method…
Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable…
We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…
Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of…
e use Prolog as a flexible meta-language to provide executable specifications of some fundamental mathematical objects and their transformations. In the process, isomorphisms are unraveled between natural numbers and combinatorial objects…
The Morse-Smale complex is a standard tool in visual data analysis. The classic definition is based on a continuous view of the gradient of a scalar function where its zeros are the critical points. These points are connected via gradient…
We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…