Related papers: Continuous limits of generalized pentagram maps

This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…

Let $\partial \mathcal{Q}$ be the boundary of a convex polygon in $\mathbb{R}^2$, $e_\alpha = (\cos\alpha, \sin \alpha)$ and $e_{\alpha}^{\bot} = (-\sin\alpha , \cos \alpha)$ be a basis of $\mathbb{R}^2$ for some $\alpha\in[0,2\pi)$ and…

This paper seeks to advance the theory of nonexpansive mappings by introducing and exploring a novel class of nonexpansive type mappings, which we aptly designate as perimetric nonexpansive mappings. We establish that the collection of…

The main purpose of this paper is to determine the solution of generalized convex set-valued mappings satisfying certain functional equation. Some conclusions of stability of set-valued functional equations are obtained.

The primary objective of this paper is to generalize the results of [arXiv:2111.03548] to the case of quasi-smooth Berkovich curves by establishing a connection between the spectrum and the radii of convergence. To achieve this, we…

We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives,…

We present a broad family of quantum baker maps that generalize the proposal of Schack and Caves to any even Hilbert space with arbitrary boundary conditions. We identify a structure, common to all maps consisting of a simple kernel…

The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation…

In this paper, we establish an improved coefficient bounds for quasiregular and elliptic harmonic mappings and using these bounds we establish Landau-Bloch type theorem for $(K,K')$-elliptic and K-quasiregular harmonic mappings in plane.…

We establish a new characterization for a conformal mapping of the unit disk $\mathbb{D}$ to be convex, and identify the mappings onto a half-plane or a parallel strip as extremals. We also show that, with these exceptions, the level sets…

We introduce a new type of mappings in metric spaces which are three-point analogue of the well-known Kannan type mappings and call them generalized Kannan type mappings. It is shown that in general case such mappings are discontinuous but…

In this paper we prove that the shift map defined on the moduli space of twisted pentagram spirals of type $(N, 1)$ possesses a non-standard Lax representation with an associated monodromy whose conjugation class is preserved by the map. We…

We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem (LCLT) for non-autonomous dynamical systems. A key advance is the extension of the spectral…

Multigraph matching is a recent variant of the graph matching problem. In this framework, the optimization procedure considers several graphs and enforces the consistency of the matches along the graphs. This constraint can be formalized as…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

The existence of translated curves for quasiperiodically forced maps is established, under very mild regularity hypotheses, for rotation numbers of constant type. Among the translated curves, the invariant curves are characterized as the…