English
Related papers

Related papers: Examining $H$-Closed Ducci Sequences on $\mathbb{Z…

200 papers

Suppose that $M$ is a connected orientable $n$-dimensional manifold and $m>2n$. If $H^i(M,\R)=0$ for $i>0$, it is proved that for each $m$ there is a monomorphism $H^m(W_n,\on{O}(n))\to H^m_{\on{cont}}(\on{Diff}M,\R)$. If $M$ is closed and…

Differential Geometry · Mathematics 2009-06-26 M. V. Losik

We study the cyclicity in weighted $\ell^p(\mathbb{Z})$ spaces. For $p \geq 1$ and $\beta \geq 0$, let $\ell^p\_\beta(\mathbb{Z})$ be the space of sequences $u=(u\_n)\_{n\in \mathbb{Z}}$ such that $(u\_n |n|^{\beta})\in \ell^p(\mathbb{Z})…

Functional Analysis · Mathematics 2017-03-09 Florian Le Manach

We continue the study of the theories of Baldwin-Shi hypergraphs from $[5]$. Restricting our attention to when the rank $\delta$ is rational valued, we show that each countable model of the theory of a given Baldwin-Shi hypergraph is…

Logic · Mathematics 2018-07-17 Danul K. Gunatilleka

This paper extends those of Glendinning and Sidorov [3] and of Hare and Sidorov [6] from the case of the doubling map to the more general $\beta$-transformation. Let $\beta \in (1,2)$ and consider the $\beta$-transformation…

Dynamical Systems · Mathematics 2015-09-21 Lyndsey Clark

We show that for each \eta>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d^+_1\le ... \le d^+_n and d^- _1 \le ... \le d^-_n satisfy (i) d^+_i \geq i+ \eta n or d^-_{n-i- \eta n} \geq n-i…

Combinatorics · Mathematics 2009-12-01 Daniela Kühn , Deryk Osthus , Andrew Treglown

We prove that a $C^{2+\alpha}$-smooth orientation-preserving circle diffeomorphism with rotation number in Diophantine class $D_\delta$, $0<\delta<\alpha\le1$, is $C^{1+\alpha-\delta}$-smoothly conjugate to a rigid rotation. We also derive…

Dynamical Systems · Mathematics 2010-07-05 Konstantin Khanin , Alexey Teplinsky

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…

Number Theory · Mathematics 2020-12-15 Carlo Sanna

Let D be the circulant digraph with n vertices and connection set {2,3,c}. (Assume D is loopless and has outdegree 3.) Work of S.C.Locke and D.Witte implies that if n is a multiple of 6, c is either (n/2) + 2 or (n/2) + 3, and c is even,…

Combinatorics · Mathematics 2007-05-23 Dave Witte Morris , Joy Morris , Kerri Webb

Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1},…

Combinatorics · Mathematics 2010-06-09 Alan Frieze , Michael Krivelevich , Po-Shen Loh

Counting homomorphisms of a constant sized pattern graph $H$ in an input graph $G$ is a fundamental computational problem. There is a rich history of studying the complexity of this problem, under various constraints on the input $G$ and…

Data Structures and Algorithms · Computer Science 2020-11-20 Suman K. Bera , Noujan Pashanasangi , C. Seshadhri

We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than…

Computational Complexity · Computer Science 2015-08-27 Andreas Göbel , Leslie Ann Goldberg , David Richerby

Let $\mathscr O_u$ be the algebra of holomorphic functions on ${\bf C}_+:=\{s\in{\bf C}:\text{Re }s>0\}$ that are limits of Dirichlet series $D=\sum_{n=1}^\infty a_n n^{-s}$, $s\in \bf{C}_+$, that converge uniformly on proper half-planes of…

Complex Variables · Mathematics 2024-04-09 Alexander Brudnyi , Amol Sasane

A diffeomorphism f has a heterodimensional cycle if it displays two (transitive) hyperbolic sets K and K' with different indices such that the unstable set of K intersects the stable one of K' and vice versa. We prove that it is possible to…

Dynamical Systems · Mathematics 2025-01-15 Sébastien Biebler

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny

We investigate the existence of a rainbow Hamilton cycle in a uniformly edge-coloured randomly perturbed digraph. We show that for every $\delta \in (0,1)$ there exists $C = C(\delta) > 0$ such that the following holds. Let $D_0$ be an…

Combinatorics · Mathematics 2024-11-20 Kyriakos Katsamaktsis , Shoham Letzter , Amedeo Sgueglia

The renowned theorem of Dirac states that if $G$ is a graph with minimum degree at least $n/2$ then $G$ has a Hamilton cycle. A natural generalisation asks what properties of an edge-colouring of $G$ guarantee the existence of a properly…

Combinatorics · Mathematics 2026-03-24 Natalie Behague , Francesco Di Braccio , Bertille Granet , Allan Lo

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

Logic · Mathematics 2014-02-14 Joel David Hamkins

A heterodimensional cycle consists of a pair of heteroclinic connections between two saddle periodic orbits with unstable manifolds of different dimensions. Recent theoretical work on chaotic dynamics beyond the uniformly hyperbolic setting…

Dynamical Systems · Mathematics 2019-06-28 Andy Hammerlindl , Bernd Krauskopf , Gemma Mason , Hinke M. Osinga

Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…

Logic · Mathematics 2020-07-01 Nicolai Kraus , Jakob von Raumer

We show that there exist constants $\delta_1,\delta_2>0$ such that if $G$ is an $(n,d,\lambda)$-graph with $\lambda/d\le\delta_1$, then $G$ contains an induced cycle of length at least $\delta_2n/d$. We further demonstrate that, up to a…

Combinatorics · Mathematics 2025-05-30 Sahar Diskin , Michael Krivelevich , Itay Markbreit , Maksim Zhukovskii