English
Related papers

Related papers: The unavoidable rotation systems

200 papers

For a symplectic twist map, we prove that there is a choice of weak K.A.M. solutions that depend in a continuous way on the cohomology class. We thus obtain a continuous function $u(\theta, c)$ in two variables: the angle $\theta$ and the…

Dynamical Systems · Mathematics 2018-09-10 Marie-Claude Arnaud , Maxime Zavidovique

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose…

Combinatorics · Mathematics 2014-01-15 Tomáš Kaiser , Matěj Stehlík , Riste Škrekovski

We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G'$ such that $G$ can be obtained form $G'$ by a finite number of $2$-cut reductions. As a consequence, some hard…

Combinatorics · Mathematics 2023-04-26 Eckhard Steffen , Isaak H. Wolf

The two-category with three-manifolds as objects, h-cobordisms as morphisms, and diffeomorphisms of these as two-morphisms, is extremely rich; from the point of view of classical physics it defines a nontrivial topological model for general…

Algebraic Topology · Mathematics 2007-05-23 Jack Morava

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

Combinatorics · Mathematics 2017-04-04 Meysam Alishahi , Hossein Hajiabolhassan , Frédéric Meunier

We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including…

Combinatorics · Mathematics 2016-06-13 Sho Kubota

We show that there is a constant $c$ such that any 3-uniform hypergraph $\mathcal H$ with $n$ vertices and at least $cn^{5/2}$ edges contains a triangulation of the real projective plane as a subgraph. This resolves a conjecture of…

Combinatorics · Mathematics 2022-10-21 Maya Sankar

There are theories of coverings of $C^*$-algebras which can be included into a following list: coverings of commutative $C^*$-algebras, coverings of $C^*$-algebras of groupoids and foliations, coverings of noncommutative tori, the double…

Operator Algebras · Mathematics 2024-07-19 Petr Ivankov

For every positive integer $t$ we construct a finite family of triple systems ${\mathcal M}_t$, determine its Tur\'{a}n number, and show that there are $t$ extremal ${\mathcal M}_t$-free configurations that are far from each other in…

Combinatorics · Mathematics 2021-02-17 Xizhi Liu , Dhruv Mubayi , Christian Reiher

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

Combinatorics · Mathematics 2014-04-02 Johannes Carmesin

Recently, settling a question of Erd\H{o}s, Balogh and Pet\v{r}\'{i}\v{c}kov\'{a} showed that there are at most $2^{n^2/8+o(n^2)}$ $n$-vertex maximal triangle-free graphs, matching the previously known lower bound. Here we characterize the…

Combinatorics · Mathematics 2016-08-07 József Balogh , Hong Liu , Šárka Petříčková , Maryam Sharifzadeh

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

Combinatorics · Mathematics 2019-01-03 Michael Giudici , Gabriel Verret

A theorem of O. Haupt, rediscovered by M. Kapovich and celebrated by his proof invoking Ratner theory, describes the set of de Rham cohomology classes on a topological orientable surface, which can be realized by an abelian differential in…

Algebraic Geometry · Mathematics 2021-04-15 Rodion N. Déev

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

Group Theory · Mathematics 2025-12-29 Yuandong Li , Binzhou Xia , Jin-Xin Zhou

Let M be a module over a commutative ring and let Spec(M) (resp. Max(M)) be the collection of all prime (resp. maximal) submodules of M. We topologize Spec(M) with Zariski topology, which is analogous to that for Spec(R), and consider…

Commutative Algebra · Mathematics 2015-09-29 Habibollah Ansari-Toroghy , Shokoufeh Habibi

A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such…

Combinatorics · Mathematics 2017-07-31 Demetres Christofides , Jan Hladký , András Máthé

We call a pair $(m,f)$ of integers, $m\geq 1$, $0\leq f \leq \binom{m}{2}$, \emph{absolutely avoidable} if there is $n_0$ such that for any pair of integers $(n,e)$ with $n>n_0$ and $0\leq e\leq \binom{n}{2}$ there is a graph on $n$…

Combinatorics · Mathematics 2021-07-30 Maria Axenovich , Lea Weber

Given a continuous dynamical system $f:X\to X$ on a compact metric space $X$ and an $m$-dimensional continuous potential $\Phi:X\to \mathbb R^m$, the (generalized) rotation set ${\rm Rot}(\Phi)$ is defined as the set of all $\mu$-integrals…

Dynamical Systems · Mathematics 2017-06-27 Michael Burr , Martin Schmoll , Christian Wolf