English
Related papers

Related papers: Clusters of Cycles

200 papers

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Metric Geometry · Mathematics 2009-06-08 Daniel Pellicer , Egon Schulte

We consider the problem Scattered Cycles which, given a graph $G$ and two positive integers $r$ and $\ell$, asks whether $G$ contains a collection of $r$ cycles that are pairwise at distance at least $\ell$. This problem generalizes the…

Discrete Mathematics · Computer Science 2016-07-27 Aistis Atminas , Marcin Kamiński , Jean-Florent Raymond

Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…

Combinatorics · Mathematics 2020-11-18 Haiyan Chen , Bojan Mohar

In this paper we extend three results about polycycles (also known as graphs) of planar smooth vector field to planar non-smooth vector fields (also known as piecewise vector fields, or Filippov systems). The polycycles considered here may…

Dynamical Systems · Mathematics 2024-05-08 Paulo Santana

The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…

Rings and Algebras · Mathematics 2025-06-03 Felix Lotter , Rosa Preiß

A set $S\subseteq V$ is called an {\em $q^+$-set} ({\em $q^-$-set}, respectively) if $S$ has at least two vertices and, for every $u\in S$, there exists $v\in S, v\neq u$ such that $N^+(u)\cap N^+(v)\neq \emptyset$ ($N^-(u)\cap N^-(v)\neq…

Combinatorics · Mathematics 2007-05-23 Gregory Gutin , Arash Rafiey , Simone Severini , Anders Yeo

Cluster ensemble is a pair of positive spaces (X, A) related by a map p: A -> X. It generalizes cluster algebras of Fomin and Zelevinsky, which are related to the A-space. We develope general properties of cluster ensembles, including its…

Algebraic Geometry · Mathematics 2009-08-04 V. V. Fock , A. B. Goncharov

We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…

Rings and Algebras · Mathematics 2008-05-19 Shih-Wei Yang , Andrei Zelevinsky

The concept of cyclic tridiagonal pairs is introduced, and explicit examples are given. For a fairly general class of cyclic tridiagonal pairs with cyclicity N, we associate a pair of `divided polynomials'. The properties of this pair…

Quantum Algebra · Mathematics 2017-03-22 P. Baseilhac , A. M. Gainutdinov , T. T. Vu

In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…

History and Overview · Mathematics 2026-01-08 A. Miroshnikov , O. Nikitenko , A. Skopenkov

Let $S$ be an upper cluster algebra, which is a subalgebra of $R$. Suppose that there is some cluster variable $x_e$ such that ${R}_{{x}_e} = S[{x}_e^{\pm 1}]$. We try to understand under which conditions ${R}$ is an upper cluster algebra,…

Commutative Algebra · Mathematics 2017-07-18 Jiarui Fei , Jerzy Weyman

An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on $n$ vertices without directed 2-cycles possesses an acyclic set of size at least $3n/5$. We…

Combinatorics · Mathematics 2014-07-31 Noah Golowich , David Rolnick

Let $G$ be a 2-connected $n$-vertex graph and $N_s(G)$ be the total number of $s$-cliques in $G$. Let $k\ge 4$ and $s\ge 2$ be integers. In this paper, we show that if $G$ has an edge $e$ which is not on any cycle of length at least $k$,…

Combinatorics · Mathematics 2021-12-02 Naidan Ji , Dong Ye

This paper is concerned with the limit cycles for planar semi-quasi-homogeneous polynomial systems. We give some explicit criteria for the nonexistence and existence of periodic orbits. Let $N=N(p,q,m,n)$ be the maximum number of limit…

Classical Analysis and ODEs · Mathematics 2011-10-11 Yulin Zhao

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

Combinatorics · Mathematics 2016-08-18 S. P. Glasby

A Berge cycle of length $\ell$ in a hypergraph is an alternating sequence of $\ell$ distinct vertices and $\ell$ distinct edges $v_1,e_1,v_2, \ldots, v_\ell, e_{\ell}$ such that $\{v_i, v_{i+1}\} \subseteq e_i$ for all $i$, with indices…

Combinatorics · Mathematics 2024-10-30 Teegan Bailey , Yupei Li , Ruth Luo

For a set of integers $I$, we define a $q$-ary $I$-cycle to be a assignment of the symbols 1 through $q$ to the integers modulo $q^n$ so that every word appears on some translate of $I$. This definition generalizes that of de Bruijn cycles,…

Combinatorics · Mathematics 2007-05-23 Joshua N. Cooper , Ronald L. Graham

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Group Theory · Mathematics 2009-01-14 Alireza Abdollahi

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

Combinatorics · Mathematics 2011-09-02 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

For a polynomial differential system $$\dot{x}=-y+\sum\limits_{i+j=3}\alpha_{i,j}x^iy^j,\quad \dot{y}=x+\sum\limits_{i+j=3}\beta_{i,j}x^iy^j,$$ Pleshkan (Differ. Equations, 1969) proved that the origin is an isochronous center of this…

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