Related papers: Staircases in Z^2
It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…
Nonlinear approximation from regular piecewise polynomials (splines) of degree $<k$ supported on rings in $\R^2$ is studied. By definition a ring is a set in $\R^2$ obtained by subtracting a compact convex set with polygonal boundary from…
A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The first author recently showed that the…
A slalom is a sequence of finite sets of length omega. Slaloms are ordered by coordinatewise inclusion with finitely many exceptions. Improving earlier results of Mildenberger, Shelah and Tsaban, we prove consistency results concerning…
This paper investigates the relationship between a system of differential equations and the underlying geometry associated with it. The geometry of a surface determines shortest paths, or geodesics connecting nearby points, which are…
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…
A section of a Hamiltonian system is a hypersurface in the phase space of the system, usually representing a set of one-sided constraints (e.g. a boundary, an obstacle or a set of admissible states). In this paper we give local…
In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
We propose a series of metrics between pairs of signals, linear systems or rational spectra, based on optimal transport and linear-systems theory. The metrics operate on the locations of the poles of rational functions and admit very…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
The Penrose triangle, staircase, and related ``impossible objects'' have long been understood as related to first cohomology $H^1$: the obstruction to extending locally consistent interpretations around a loop. This paper develops a…
We consider the time evolution of a one dimensional $n$-gradient continuum. Our aim is to construct and analyze discrete approximations in terms of physically realizable mechanical systems, called microscopic because they are living on a…
We analyze dynamical properties of a "gap-tent map" - a family of 1D maps with a symmetric gap, which mimics the presence of noise in physical realizations of chaotic systems. We demonstrate that the dependence of the topological entropy on…
A Sturmian sequence is an infinite nonperiodic string over two letters with minimal subword complexity. In two papers, the first written by Morse and Hedlund in 1940 and the second by Coven and Hedlund in 1973, a surprising correspondence…
Many real-world machine learning problems involve inherently hierarchical data, yet traditional approaches rely on Euclidean metrics that fail to capture the discrete, branching nature of hierarchical relationships. We present a theoretical…
This paper is part of a program to understand the parameter spaces of dynamical systems generated by meromorphic functions with finitely many singular values. We give a full description of the parameter space for a specific family based on…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
This survey article is the outgrowth of two talks given at the Journ\'ees X-UPS "P\'eriodes et transcendance" at \'Ecole polytechnique. Periods are complex numbers whose real and imaginary parts can be written as integrals of rational…