中文
相关论文

相关论文: Clusters of Cycles

200 篇论文

It is known that every matrix of order n over the maximal order in an algebraic number eld is a sum of k-th powers in various cases if a discriminant condition is satis ed. It has been proved by Wadikar and Katre that for every matrix of…

数论 · 数学 2025-10-16 S. A Katre , Deepa Krishnamurthi

The clustering coefficient of a vertex in a graph is the proportion of neighbours of the vertex that are adjacent. The minimum clustering coefficient of a graph is the smallest clustering coefficient taken over all vertices. A complete…

组合数学 · 数学 2016-01-08 Adam Borchert , Skylar Nicol , Ortrud R. Oellermann

We investigate the problem of defining group or loop structures on spheres, where by ''sphere'' we mean the level set q(x) = c of a general K-valued quadratic form q, for an invertible scalar c. When K is a field and q non-degenerate, then…

群论 · 数学 2024-10-24 Wolfgang Bertram

We develop an elementary formula for certain non-trivial elements of upper cluster algebras. These elements have positive coefficients. We show that when the cluster algebra is acyclic these elements form a basis. Using this formula, we…

环与代数 · 数学 2015-06-29 Kyungyong Lee , Li Li , Matthew R. Mills

In this paper we study cycles in random bipartite graph $G(n,n,p)$. We prove that if $p\gg n^{-2/3}$, then $G(n,n,p)$ a.a.s. satisfies the following. Every subgraph $G'\subset G(n,n,p)$ with more than $(1+o(1))n^2p/2$ edges contains a cycle…

组合数学 · 数学 2013-10-15 Yilun Shang

It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…

组合数学 · 数学 2026-04-22 Robert Dougherty-Bliss , Sergi Elizalde

A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…

组合数学 · 数学 2024-08-07 Joseph E. Bonin , Anna de Mier

If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…

组合数学 · 数学 2018-11-08 Andrey O. Matveev

The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of $\mathbb{R}$…

经典分析与常微分方程 · 数学 2023-01-02 Romanos Diogenes Malikiosis

Let $\G(v,e)$ be the set of all simple graphs with $v$ vertices and $e$ edges and let $P_2(G)=\sum d_i^2$ denote the sum of the squares of the degrees, $d_1, >..., d_v$, of the vertices of $G$. It is known that the maximum value of $P_2(G)$…

We show that every $3$-uniform hypergraph $H=(V,E)$ with $|V(H)|=n$ and minimum pair degree at least $(4/5+o(1))n$ contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the P\'osa-Seymour…

组合数学 · 数学 2022-07-08 Wiebke Bedenknecht , Christian Reiher

Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…

组合数学 · 数学 2023-07-03 J. Fromentin , P. -L Giscard , T. Karaboghossian

Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\geq 3$ ($v_i\neq v_j$ for all $i,j=0,1,\ldots,p-1$, $i\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either…

组合数学 · 数学 2016-01-08 Ruonan Li , Bo Ning , Shenggui Zhang

For a real algebraic K3 surface $X(R)$, we give all possible values of the dimension $h^1_{alg}(X(R)$ of the group $\H^1_{alg}(X(R),Z/2)$ of algebraic cycles of $X(R)$. In particular, we prove that if $X(R)$ is not an M-surface, $X(R)$ can…

alg-geom · 数学 2025-05-23 Frédéric Mangolte

A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$ of order $s$ has size at least $t.$ An edge $e$ in a graph $G$ of order $n$ is called pancyclic if for every integer $k$ with $3\le k\le n,$ $e$ lies in a $k$-cycle. We…

组合数学 · 数学 2025-11-12 Chengli Li , Xingzhi Zhan

With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…

组合数学 · 数学 2010-01-19 Frank H. Lutz

Let X be a normal projective variety admitting an action of a semisimple group with a unique closed orbit. We construct finitely many rational curves in X, all having a common point, such that every effective one-cycle on X is rationally…

代数几何 · 数学 2007-05-23 Michel Brion

In Lie sphere geometry, a cycle in $\RR^n$ is either a point or an oriented sphere or plane of codimension $1$, and it is represented by a point on a projective surface $\Omega\subset \PP^{n+2}$. The Lie product, a bilinear form on the…

代数几何 · 数学 2013-11-25 Borut Jurčič Zlobec , Neža Mramor Kosta

In this paper, the author constructs a family of algebraic cycles in Bloch's cubical cycle complex over the projective line minus three points which are expected to correspond to multiple polylogarithms in one variable. Elements in this…

代数几何 · 数学 2016-01-20 Ismaël Soudères

A Berge cycle of length $\ell$ in a hypergraph $\mathcal{H}$ is a sequence of alternating vertices and edges $v_0e_0v_1e_1...v_\ell e_\ell v_0$ such that $\{v_i,v_{i+1}\}\subseteq e_i$ for all $i$, with indices taken modulo $\ell$. For $n$…

组合数学 · 数学 2025-05-02 Teegan Bailey , Isaiah Hollars , Yupei Li , Ruth Luo