中文
相关论文

相关论文: Clusters of Cycles

200 篇论文

Let G be a graph whose edges are labeled by positive integers. Label each vertex with an integer and suppose if two vertices are joined by an edge, the vertex labels are congruent to each other modulo the edge label. The set of vertex…

组合数学 · 数学 2014-09-05 Madeline Handschy , Julie Melnick , Stephanie Reinders

Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…

交换代数 · 数学 2015-07-15 Elisângela Silva Dias , Diane Castonguay

This is the first in a series of articles devoted to providing a foundation for a theory of flocks of arbitrary cones in PG(3,q). The desire to have such a theory stems from a need to better understand the very significant and applicable…

组合数学 · 数学 2009-11-03 William Cherowitzo

The cyclic graph of a group $G$ is the graph whose vertices are the nonidentity elements of $G$ and whose edges connect distinct elements $x$ and $y$ if and only if the subgroup $\langle x,y\rangle$ is cyclic. We obtain information about…

群论 · 数学 2021-03-30 David G. Costanzo , Mark L. Lewis

With any non necessarily orientable unpunctured marked surface (S,M) we associate a commutative algebra, called quasi-cluster algebra, equipped with a distinguished set of generators, called quasi-cluster variables, in bijection with the…

环与代数 · 数学 2015-02-17 Grégoire Dupont , Frédéric Palesi

Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…

组合数学 · 数学 2020-10-29 Peter J. Cameron , Liam Stott

A contractible simplicial complex is constructed that parametrizes different ways of representing a fixed one-dimensional homology class in a closed orientable surface by isotopy classes of systems of disjoint oriented simple closed curves.…

几何拓扑 · 数学 2008-06-03 Allen Hatcher

The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…

组合数学 · 数学 2024-12-24 Fern Gossow

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

组合数学 · 数学 2010-02-17 Allen Knutson , Ezra Miller , Alexander Yong

Let $ex(Q_n, H)$ be the largest number of edges in a subgraph $G$ of a hypercube $Q_n$ such that there is no subgraph of $G$ isomorphic to $H$. We show that for any integer $k\geq 3$, $$ex(Q_n, C_{4k+2})= O(n^{\frac{5}{6} +…

组合数学 · 数学 2022-11-29 Maria Axenovich

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

组合数学 · 数学 2018-08-21 Richard J. Mathar

For a fixed planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal{P}}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In the case when $H$ is a cycle, the asymptotic value of…

组合数学 · 数学 2021-06-08 Christopher Cox , Ryan R. Martin

When the sequence of regular polygons with consecutively increasing numbers of sides is joined edge-to-edge in a single direction while minimizing bending, the resulting structure assumes the shape of a logarithmic spiral. This paper proves…

综合数学 · 数学 2026-02-13 Juno Park

We study ordered configuration spaces $C(n;p,q)$ of $n$ hard squares in a $p \times q$ rectangle, a generalization of the well-known "15 Puzzle". Our main interest is in the topology of these spaces. Our first result is to describe a…

代数拓扑 · 数学 2023-09-13 Hannah Alpert , Ulrich Bauer , Matthew Kahle , Robert MacPherson , Kelly Spendlove

The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…

历史与综述 · 数学 2016-10-04 Steven Finch

To any semigroup presentation $\mathcal{P}= \langle \Sigma \mid \mathcal{R} \rangle$ and base word $w \in \Sigma^+$ may be associated a nonpositively curved cube complex $S(\mathcal{P},w)$, called a Squier complex, whose underlying graph…

群论 · 数学 2018-10-24 Anthony Genevois

A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…

群论 · 数学 2024-09-24 Khyati Sharma , A. Satyanarayana Reddy

A center of a differential system in the plane $\mathbb{R}^2$ is an equilibrium point $p$ having a neighborhood $U$ such that $U\setminus \{p\}$ is filled of periodic orbits. A center $p$ is global when $\mathbb{R}^2\setminus \{p\}$ is…

动力系统 · 数学 2023-12-12 Leonardo P. C. da Cruz , Jaume LLibre

Given a number $r$, we consider the dynamical system generated by repeated exponentiations modulo $r$, that is, by the map $u \mapsto f_g(u)$, where $f_g(u) \equiv g^u \pmod r$ and $0 \le f_g(u) \le r-1$. The number of cycles of the defined…

数论 · 数学 2010-06-15 Lev Glebsky

Let $\CC$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster-tilting object $T$. Under a constructibility condition we prove the existence of a set $\mathcal G^T(\CC)$ of generic values of the cluster character associated to…

表示论 · 数学 2011-03-04 G. Dupont