English
Related papers

Related papers: Quasi-forest simplicial complexes and almost Cohen…

200 papers

Weak almost contact manifolds, i.e., the linear complex structure on the contact distribution is approximated by a nonsingular skew-symmetric tensor, defined by the author and R. Wolak (2022), allowed a new look at the theory of contact…

Differential Geometry · Mathematics 2024-05-03 Vladimir Rovenski

We introduce the notion of mixed subtree quasi-isometries, which are self quasi-isometries of regular trees built in a specific inductive way. We then show that any self quasi-isometry of a regular tree is at bounded distance from a…

Group Theory · Mathematics 2025-01-01 Antoine Goldsborough , Stefanie Zbinden

We consider quasicomplexes of pseudodifferential operators on a smooth compact manifold without boundary. To each quasicomplex we associate a complex of symbols. The quasicomplex is elliptic if this symbol complex is exact away from the…

Analysis of PDEs · Mathematics 2011-09-19 Daniel Wallenta

We discuss $\pmb{SC}_*$, a simplicial homotopy model of $K(Z,2)$ constructed from circular permutations. In any dimension, the number of simplices in the model is finite. The complex $\pmb{SC}_*$ naturally manifests as a simplicial set…

Algebraic Topology · Mathematics 2024-08-20 Nikolai Mnëv

A graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $\delta(G)\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $\delta(G)\geq |G|/2$, then $G$ has a…

Combinatorics · Mathematics 2016-07-22 Amelia Taylor

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

For positive integers $d<n$, let $[n]_d=\{A\in 2^{[n]}\mid |A|=d\}$ where $[n]=:\{1,2,\ldots, n\}$. For a pure $f$-simplicial complex $\Delta$ such that ${\rm dim}(\Delta)={\rm dim}(\Delta^c)$ and $\mathcal{F}(\Delta)\cap…

Commutative Algebra · Mathematics 2021-02-12 A-Ming Liu , Jin Guo , Tongsuo Wu

We prove that the simplicial complex whose simplices are the nonempty partial bases of $\mathbb{F}_n$ is homotopy equivalent to a wedge of $(n-1)$-spheres. Moreover, we show that it is Cohen-Macaulay.

Algebraic Topology · Mathematics 2020-01-08 Iván Sadofschi Costa

Given a quasiperiodic cocycle in sl(2, R) sufficiently close to a constant, we prove that it is almost-reducible in ultradifferentiable class under an adapted arithmetic condition on the frequency vector. We also give a corollary on the…

Dynamical Systems · Mathematics 2022-05-26 Maxime Chatal , Claire Chavaudret

Let $G_1$ be a planar graph such that all cycles of length at most 4 are independent and let $G_2$ be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of $G_1$ and $G_2$ can be equitably…

Combinatorics · Mathematics 2014-03-13 Xin Zhang

Smale-Barden manifolds are simply-connected closed 5-manifolds. It is an important and difficult question to decide when a Smale-Barden manifold admits a Sasakian or a K-contact structure. The known constructions of Sasakian and K-contact…

Differential Geometry · Mathematics 2020-04-28 A. Cañas , V. Muñoz , M. Schütt , A. Tralle

Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…

Combinatorics · Mathematics 2025-12-29 Marc Distel

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

Group Theory · Mathematics 2023-07-25 Reymond Akpanya , Tom Goertzen

Let $G$ be a 3-connected planar graph. Define the co-tree of a spanning tree $T$ of $G$ as the graph induced by the dual edges of $E(G)-E(T)$. The well-known cut-cycle duality implies that the co-tree is itself a tree. Let a $k$-tree be a…

Discrete Mathematics · Computer Science 2024-06-05 Christian Ortlieb , Jens M. Schmidt

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…

Information Theory · Computer Science 2007-07-16 Eric Zhi Chen

We call a projective Calabi-Yau (CY) 3-fold almost generic if it has only isolated nodes as singularities and the homology classes of all of the exceptional curves in an analytic small resolution are non-trivial but torsion. Such a…

High Energy Physics - Theory · Physics 2025-04-09 Thorsten Schimannek

We define and study the notion of a minimal Cohen-Macaulay simplicial complex. We prove that any Cohen-Macaulay complex is shelled over a minimal one in our sense, and we give sufficient conditions for a complex to be minimal…

Combinatorics · Mathematics 2019-05-14 Hailong Dao , Joseph Doolittle , Justin Lyle

Any gentle algebra $A$ with one maximal path corresponds to a unique quasi-diagram $\alpha$. We introduce the regularity for $\alpha$, and show that $A$ has finite global dimension if and only if $\alpha$ is regular. We characterize regular…

Rings and Algebras · Mathematics 2024-03-07 Haigang Hu , Xiao-Chuang Wang , Yu Ye

For some $k \in \mathbb{Z}_{\geq 0}\cup \infty$, we call a linear forest $k$-bounded if each of its components has at most $k$ edges. We will say a $(k,\ell)$-bounded linear forest decomposition of a graph $G$ is a partition of $E(G)$ into…

Combinatorics · Mathematics 2023-01-30 Rutger Campbell , Florian Hörsch , Benjamin Moore

Given a set of $k$-colored points in the plane, we consider the problem of finding $k$ trees such that each tree connects all points of one color class, no two trees cross, and the total edge length of the trees is minimized. For $k=1$,…

Computational Geometry · Computer Science 2016-11-07 Sergey Bereg , Krzysztof Fleszar , Philipp Kindermann , Sergey Pupyrev , Joachim Spoerhase , Alexander Wolff