English
Related papers

Related papers: On the conjecture by Demyanov-Ryabova in convertin…

200 papers

It was conjectured by Vladimir Demyanov and Julia Ryabova in 2011 that the minimal cycle in the sequence obtained via repeated application of Demyanov converter to a finite family of polytopes is at most two. We construct a counterexample…

Optimization and Control · Mathematics 2018-07-04 Vera Roshchina

In this work we are interested in the Demyanov--Ryabova conjecture for a finite family of polytopes. The conjecture asserts that after a finite number of iterations (successive dualizations), either a 1-cycle or a 2-cycle eventually comes…

Optimization and Control · Mathematics 2017-09-07 Aris Daniilidis , Colin Petitjean

We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex…

Differential Geometry · Mathematics 2017-08-25 Alexander I. Bobenko , Ivan Izmestiev

A rack is a set with a binary operation such that left multiplications are automorphisms of the set and a quandle is a rack satisfying a certain condition. For a finite connected rack the cycle type of the permutation defined by left…

Group Theory · Mathematics 2021-09-30 Selçuk Kayacan

We consider cycle decompositions of even, $2an$-dimensional hypercubes $Q_{2an},$ where $a \geq 3$ is odd and $n \geq 1.$ Prior work done by Axenovich, Offner, and Tompkins focused on obtaining the existence of cycle decompositions for…

Combinatorics · Mathematics 2024-03-07 Idael Martinez-Perez

The cycle double cover conjecture states that a graph is bridge-free if and only if there is a family of edge-simple cycles such that each edge is contained in exactly two of them. It was formulated independently by Szekeres (1973) and…

Discrete Mathematics · Computer Science 2012-02-08 Alexander Souza

Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to length $n!+n-1-i(n-1)$ for any $i \in [(n-2)!]$, by introducing…

Combinatorics · Mathematics 2023-08-14 Rachel Kirsch , Bernard Lidický , Clare Sibley , Elizabeth Sprangel

We prove the boundedness of complements modulo two conjectures: Borisov-Alexeev conjecture and effective adjunction for fibre spaces. We discuss the last conjecture and prove it in two particular cases.

Algebraic Geometry · Mathematics 2010-04-26 Yu. G. Prokhorov , V. V. Shokurov

Motivated by the proof of Rump of a conjecture of Gateva-Ivanova on the decomposability of square-free solutions to the Yang-Baxter equation, we present several other decomposability theorems based on the cycle structure of a certain…

Exactly Solvable and Integrable Systems · Physics 2022-12-15 S. Ramírez , L. Vendramin

In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…

Combinatorics · Mathematics 2017-10-10 L. Wang , S. Lu , H. Cao

In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a…

Combinatorics · Mathematics 2020-10-09 Ricky X. F. Chen

We show that if a polyhedron in the three-dimensional affine space with triangular faces is flexible, i.e., can be continuously deformed preserving the shape of its faces, then there is a cycle of edges whose lengths sum up to zero once…

Metric Geometry · Mathematics 2022-03-21 Matteo Gallet , Georg Grasegger , Jan Legerský , Josef Schicho

This paper is devoted to study the limit cycle problem of a cubic reversible system with an isochronous center, when it is perturbed inside a class of polynomials. An upper bound of the number of limit cycles is obtained using the Abelian…

Dynamical Systems · Mathematics 2025-03-13 Jihua Yang , Qipeng Zhang

We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.

Combinatorics · Mathematics 2015-08-05 Darryn Bryant , Daniel Horsley , Barbara Maenhaut , Benjamin R. Smith

We consider surfaces with a double elliptic fibration, with two sections. We study the orbits under the induced translation automorphisms proving that, under natural conditions, the finite orbits are confined to a curve. This goes in a…

Number Theory · Mathematics 2023-02-13 Pietro Corvaja , Jacob Tsimerman , Umberto Zannier

We show that the existence of one simple closed Reeb orbit of a particular type (a symplectically degenerate maximum) forces the Reeb flow to have infinitely many periodic orbits. We use this result to give a different proof of a recent…

Symplectic Geometry · Mathematics 2012-10-19 Viktor L. Ginzburg , Doris Hein , Umberto L. Hryniewicz , Leonardo Macarini

General Markov chains in an arbitrary phase space are considered in the framework of the operator treatment. Markov operators continue from the space of countably additive measures to the space of finitely additive measures. Cycles of…

Probability · Mathematics 2020-12-09 Alexander I. Zhdanok

We consider extensions of Anosov diffeomorphisms of an infranilmanifold by the real vector space R^{\omega}. Our main result, based on the analogous theorem in finite dimensions proven by Nitica and Pollicott, is that any Holder cocycle…

Dynamical Systems · Mathematics 2012-09-12 Zev Rosengarten , Asaf Reich

Let $D$ be a $k$-regular bipartite tournament on $n$ vertices. We show that, for every $p$ with $2 \le p \le n/2-2$, $D$ has a cycle $C$ of length $2p$ such that $D \setminus C$ is hamiltonian unless $D$ is isomorphic to the special digraph…

Combinatorics · Mathematics 2021-02-10 Stéphane Bessy , Jocelyn Thiebaut

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Combinatorics · Mathematics 2021-01-27 Jun Gao , Qingyi Huo , Chun-Hung Liu , Jie Ma
‹ Prev 1 2 3 10 Next ›