Related papers: Inverting the General Order Sweep Map

In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…

A novel family of integrable third order maps is presented. Each map possesses, by construction, a pair of rational invariants and a commuting map from the same class. The 3-dimensional invariant curve is parametrized, in general, by an…

For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

Let $X$ and $Y$ be finite complexes. When $Y$ is a nilpotent space, it has a rationalization $Y \to Y_{(0)}$ which is well-understood. Early on it was found that the induced map $[X,Y] \to [X,Y_{(0)}]$ on sets of mapping classes is…

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

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…

Recursive maps of high order of convergence $m$ (say $m=2^{10}$ or $m=2^{20}$) induce certain monotone step functions from which one can filter relevant information needed to globally separate and compute the real roots of a function on a…

The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the sixties. Following the bijective approach initiated by Cori and…

Given a finite, flat morphism between embeddable noetherian schemes of pure dimension 1, we define the notion of direct and inverse image for generalized divisors and generalized line bundles. In the case when we deal with (possibly…

There has recently been renewed recognition of the need to understand the consistency properties that must be preserved when a generalized matrix inverse is required. The most widely known generalized inverse, the Moore-Penrose…

In this work, we introduce a new type of generalized inverse called dual core-EP generalized inverse (in short DCEPGI) for dual square matrices. We analyze the existence and uniqueness of the DCEPGI inverse and its compact formula using…

We consider maps which preserve functions which are built out of the invariants of some simple vector fields. We give a reduction procedure, which can be used to derive commuting maps of the plane, which preserve the same symplectic form…

The deep diagonal map $T_k$ acts on planar polygons by connecting the $k$-th diagonals and intersecting them successively. The map $T_2$ is the pentagram map, and $T_k$ is a generalization. We study the action of $T_k$ on two subsets of the…

Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to…

Fix $c\in (0,1)$ and let $\Gamma$ be a $\lfloor c n\rfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $\Gamma$ is invertible with high…

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

The concept of Generalized Inverse based Decoding (GID) is introduced, as an algebraic framework for the syndrome decoding problem (SDP) and low weight codeword problem (LWP). The framework has ground on two characterizations by generalized…

The Cartesian reverse derivative is a categorical generalization of reverse-mode automatic differentiation. We use this operator to generalize several optimization algorithms, including a straightforward generalization of gradient descent…

In this paper, a simple proof is presented for the convergence of the algorithms for the class of relaxed $(u, v)$-cocoercive mappings and $\alpha$-inverse strongly monotone mappings. Based on $\alpha$-expansive maps, for example, a simple…