English
Related papers

Related papers: The Dynamics and Orbit Structure of the Topdrop Ma…

200 papers

Using experimental techniques, we study properties of the "circumcenter map", which, upon $n$ iterations sends an $n$-gon to a scaled and rotated copy of itself. We also explore the topology of area-expanding and area-contracting regions…

Dynamical Systems · Mathematics 2022-05-17 Nicholas McDonald , Ronaldo Garcia , Dan Reznik

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

Combinatorics · Mathematics 2016-08-19 Robert Coquereaux , Jean-Bernard Zuber

We show that, for two commuting automorphisms of the torus and for two elements of the Cartan action on compact higher rank homogeneous spaces, many points have drastically different orbit structures for the two maps. Specifically, using…

Dynamical Systems · Mathematics 2014-05-22 Vitaly Bergelson , Manfred Einsiedler , Jimmy Tseng

We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the p norm of the vector of…

Data Structures and Algorithms · Computer Science 2012-12-20 David Bremner , Timothy M. Chan , Erik D. Demaine , Jeff Erickson , Ferran Hurtado , John Iacono , Stefan Langerman , Mihai Patrascu , Perouz Taslakian

For a continuous map on a topological graph containing a loop $S$ it is possible to define the degree (with respect to the loop $S$) and, for a map of degree $1$, rotation numbers. We study the rotation set of these maps and the periods of…

Dynamical Systems · Mathematics 2019-01-08 Lluís Alsedà , Sylvie Ruette

We investigate the mathematics behind unshuffles, a type of card shuffle closely related to classical perfect shuffles. To perform an unshuffle, deal all the cards alternately into two piles and then stack the one pile on top of the other.…

Combinatorics · Mathematics 2024-10-09 Cornelia A. Van Cott , Katie Wang

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

Computational Geometry · Computer Science 2024-10-10 Oswin Aichholzer , Anna Brötzner , Daniel Perz , Patrick Schnider

We examine the orbits of the (complex) symplectic group, $Sp_n$, on the flag manifold, $\mathscr{F}\ell(\mathbb{C}^{2n})$, in a very concrete way. We use two approaches: we Gr\"obner degenerate the orbits to unions of Schubert varieties…

Algebraic Geometry · Mathematics 2014-11-11 Anna Bertiger

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

Combinatorics · Mathematics 2011-06-10 Hidehiko Kamiya , Akimichi Takemura , Hiroaki Terao

This paper introduces the notion of second minimal $n$-periodic orbit of the continuous map on the interval according as if $n$ is a successor of the minimal period of the map in Sharkovski ordering. We pursue classification of second…

Dynamical Systems · Mathematics 2017-06-28 Ugur G. Abdulla , Rashad U. Abdulla , Muhammad U. Abdulla , Naveed H. Iqbal

We prove that there exists a scrambled set for the Gauss map with full Hausdorff dimension. Meanwhile, we also investigate the topological properties of the sets of points with dense or non-dense orbits.

Dynamical Systems · Mathematics 2016-09-01 Weibin Liu , Bing Li

This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…

Logic · Mathematics 2012-11-01 K. Dosen , Z. Petric

We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…

Geometric Topology · Mathematics 2009-09-25 Victor A. Vassiliev

We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…

Combinatorics · Mathematics 2025-12-08 Jérémie Bettinelli , Dimitri Korkotashvili

We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, $N$. This problem has been considered before only in the limit cases of circle packing inside a circle and on a sphere…

Soft Condensed Matter · Physics 2024-08-23 Paolo Amore

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

We study a family of maps from $S_n \to S_n$ we call fixed point homing shuffles. These maps generalize a few known problems such as Conway's Topswops, and a card shuffling process studied by Gweneth McKinley. We show that the iterates of…

Combinatorics · Mathematics 2025-08-20 Jonathan Parlett

Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…

Dynamical Systems · Mathematics 2009-04-29 David Färm

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Combinatorics · Mathematics 2009-09-02 Dainis Zeps
‹ Prev 1 2 3 10 Next ›