Related papers: Algorithm for determining pure pointedness of self…
The overlap Dirac operator, which satisfies the Ginsparg-Wilson relation, realizes exact chiral symmetry on the lattice without any unphysical doubler modes. To perform the path integrals, one should, however, note that the overlap fermion…
We over-approximate reachability sets in string rewriting by languages defined by admissible factors, called tiles. A sparse set of tiles contains only those that are reachable in derivations, and is constructed by completing an automaton.…
Tile B-splines in $\mathbb{R}^d$ are defined as autoconvolutions of the indicators of tiles, which are special self-similar compact sets whose integer translates tile the space $\mathbb{R}^d$. These functions are not piecewise-polynomial,…
We consider the problem of finding a large color space that can be generated by all units in multi-projector tiled display systems. Viewing the problem geometrically as one of finding a large parallelepiped within the intersection of…
Regular model sets, describing the point positions of ideal quasicrystallographic tilings, are mathematical models of quasicrystals. An important result in mathematical diffraction theory of regular model sets, which are defined on locally…
The relative configurational entropy per cell as a function of length scale is a sensitive detector of spatial self-similarity. For Sierpinski carpets the equally separated peaks of the above function appear at the length scales that depend…
We develop a general framework of Euclidean patterns and pattern spaces of translational finite local complexity (FLC), analogues of translational tiling spaces. The notion of a self affine substitution of tilings is extended to both…
A simple algorithm is described to target any desired operation point for simple one-dimensional and two-dimensional dynamical systems. What makes the algorithm unique is the fact that it targets any desired point, not merely a…
Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…
In recent years it was proved that simple modifications of the classical Frank-Wolfe algorithm (aka conditional gradient algorithm) for smooth convex minimization over convex and compact polytopes, converge with linear rate, assuming the…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
We investigate tiling properties of spectra of measures, i.e., sets $\Lambda$ in $\br$ such that $\{e^{2\pi i \lambda x}: \lambda\in\Lambda\}$ forms an orthogonal basis in $L^2(\mu)$, where $\mu$ is some finite Borel measure on $\br$. Such…
Self-similarity is the essence of fractal images and, as such, characterizes natural stochastic textures. This paper is concerned with the property of self-similarity in the statistical sense in the case of fully-textured images that…
We obtain better algorithms for computing more balanced orientations and degree splits in LOCAL. Important to our result is a connection to the hypergraph sinkless orientation problem [BMNSU, SODA'25] We design an algorithm of complexity…
The goal of this article is to study how combinatorial equivalence implies topological conjugacy. For that, we introduce the concept of kneading sequences for nonautonomous discrete dynamical systems and show that these sequences are a…
We introduce a novel matching algorithm, called DeepMatching, to compute dense correspondences between images. DeepMatching relies on a hierarchical, multi-layer, correlational architecture designed for matching images and was inspired by…
We introduce a formalism for handling general spaces of hierarchical tilings, a category that includes substitution tilings, Bratteli-Vershik systems, S-adic transformations, and multi-dimensional cut-and-stack transformations. We explore…
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…