English
Related papers

Related papers: Total cut complexes and their duals

200 papers

We investigate the hypercohomologies of truncated twisted holomorphic de Rham complexes on (not necessarily compact) complex manifolds. In particular, we generalize Leray-Hirsch, K\"{u}nneth and Poincar\'{e}-Serre duality theorems on them.…

Algebraic Geometry · Mathematics 2020-06-02 Lingxu Meng

We study consequences and applications of the folklore statement that every double complex over a field decomposes into so-called squares and zigzags. This result makes questions about the associated cohomology groups and spectral sequences…

Representation Theory · Mathematics 2021-04-07 Jonas Stelzig

We construct a natural chain map from the Kontsevich graph complex to the rational singular chain complex of $B\mathrm{Diff}_\partial(D^{2k})$ when the dimension $2k$ is sufficiently large, generalizing Goussarov and Habiro's theories of…

Geometric Topology · Mathematics 2026-01-14 Boris Botvinnik , Tadayuki Watanabe

An iterative scheme is set up for solving the loop equation of the hermitian one-matrix model with a multi-cut structure. Explicit results are presented for genus one for an arbitrary but finite number of cuts. Due to the complicated form…

High Energy Physics - Theory · Physics 2009-10-30 G. Akemann

Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…

Algebraic Geometry · Mathematics 2012-03-14 János Kollár

In this paper, we collect a number of facts about double Hurwitz numbers, where the simple branch points are replaced by their more general analogues --- completed (r+1)-cycles. In particular, we give a geometric interpretation of these…

Combinatorics · Mathematics 2014-02-26 S. Shadrin , L. Spitz , D. Zvonkine

The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lov\'asz and Plummer developed a decomposition theory for graphs with perfect…

Combinatorics · Mathematics 2019-03-01 Isabel Beckenbach , Meike Hatzel , Sebastian Wiederrecht

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

Combinatorics · Mathematics 2020-04-07 Farid Bouya , Ebadollah S. Mahmoodian , Modjtaba Shokrian Zini , Mojtaba Tefagh

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

Combinatorics · Mathematics 2007-05-23 E. Babson , H. Barcelo , M. de Longueville , R. Laubenbacher

This paper is a synthesis and extension of three earlier papers on $PD_4$-complexes $X$ with fundamental group $\pi$ such that $c.d.\pi=2$ and $\pi$ has one end. Our goal is to show that the homotopy types of such complexes are determined…

Geometric Topology · Mathematics 2026-05-14 Jonathan A. Hillman

For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these…

Combinatorics · Mathematics 2020-11-18 Mikhail Gorsky

We study extensively the homotopy theory of coalgebras. By coalgebras, we mean the full theory of coalgebras: with counits and not necessarily locally conilpotent. For example $\mathcal E_\infty$-coalgebras, $\mathcal A_\infty$-coalgebras,…

Algebraic Topology · Mathematics 2022-03-11 Brice Le Grignou , Damien Lejay

In this note we formulate and prove a version of Cartan decomposition for holomorphic loop groups, similar to Cartan decomposition for $p$-adic loop groups, discussed proved by Garland (and later by the authors by geometric mathods). The…

Representation Theory · Mathematics 2014-02-07 Alexander Braverman , David Kazhdan

We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…

Combinatorics · Mathematics 2018-11-20 Hao Hu , Monique Laurent

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

Geometric Topology · Mathematics 2017-12-12 Stavros Garoufalidis , Ezra Getzler

In this paper we introduce a particular class of Heffter arrays, called globally simple Heffter arrays, whose existence gives at once orthogonal cyclic cycle decompositions of the complete graph and of the cocktail party graph. In…

Combinatorics · Mathematics 2018-06-13 Simone Costa , Fiorenza Morini , Anita Pasotti , Marco Antonio Pellegrini

We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…

Algebraic Topology · Mathematics 2022-11-28 Marek Filakovský , Lukáš Vokřínek

We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…

Representation Theory · Mathematics 2018-05-04 C. Bowman , A. G. Cox

Methods are developed to relate the action of a principal fibration to relative Whitehead products in order to determine the homotopy type of certain spaces. The methods are applied to thoroughly analyze the homotopy type of the based loops…

Algebraic Topology · Mathematics 2022-03-01 Piotr Beben , Stephen Theriault

The total eccentricity index of a connected graph is defined as sum of the eccentricities of all its vertices. We denote the set of all connected graphs on $n$ vertices with $k$ pendant vertices by $\mathfrak{H}_{n,k}$ and denote the set of…

Combinatorics · Mathematics 2022-04-05 Dinesh Pandey , Kamal Lochan Patra
‹ Prev 1 4 5 6 7 8 10 Next ›