English
Related papers

Related papers: Depicting a generalized shift move in crown diagra…

200 papers

This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…

Combinatorics · Mathematics 2026-03-24 Muhammad Raza , Obaid Ullah Ahmad , Mudassir Shabbir , Waseem Abbas

In this paper we will show that two surfaces of the same genus and homology class in a simply connected 4-manifold are concordant. We will show they are often topologically isotopic when their complements have cyclic fundamental group.…

Geometric Topology · Mathematics 2013-05-29 Nathan Sunukjian

Kauer moves are local moves of an edge in a Brauer graph that yield derived equivalences between Brauer graph algebras [Kau98]. These derived equivalences may be interpreted in terms of silting mutations. In this paper, we generalize the…

Representation Theory · Mathematics 2023-05-11 Valentine Soto

The quantum switch is a higher-order operation that takes as an input two quantum processes and combines them in a coherent superposition of two alternative orders. Here we provide an approach to the quantum switch based on the methods of…

Quantum Physics · Physics 2021-09-07 Matt Wilson , Giulio Chiribella

We prove a cyclic Lefschetz formula for foliations. To this end, we define a notion of equivariant cyclic cohomology and show that its expected pairing with K-theory is well defined. This enables to associate to any invariant transverse…

K-Theory and Homology · Mathematics 2011-04-26 Moulay-Tahar Benameur

In 1968, Erd\"os defined the Shift Graph as the graph whose vertices are the $k$-element subsets of $[n]=\{0,1,2,...,n-1\}$ such that $A=\{a_1,...,a_k\}$ and $B=\{b_1,...,b_k\}$ are neighbours iff $a_1<b_1=a_2<b_2=a_3<... <b_{n-1}=a_n<b_n$.…

Logic · Mathematics 2017-04-17 Milette Riis

Generalized symmetry extends the usual notion of symmetry to ones that are of higher-form, acting on subsystems, non-invertible, etc. The concept was originally defined in the field theory context using the idea of topological defects. On…

Strongly Correlated Electrons · Physics 2025-07-31 Nathanan Tantivasadakarn , Xinyu Liu , Xie Chen

The switching model is a Markov chain approach to sample graphs with fixed degree sequence uniformly at random. The recently invented Curveball algorithm for bipartite graphs applies several switches simultaneously (`trades'). Here, we…

Combinatorics · Mathematics 2018-07-27 Corrie Jacobien Carstens , Annabell Berger , Giovanni Strona

We study a generalization of higher gauge theory which makes use of generalized geometry and seems to be closely related to double field theory. The local kinematical data of this theory is captured by morphisms of graded manifolds between…

High Energy Physics - Theory · Physics 2016-04-13 Patricia Ritter , Christian Saemann , Lennart Schmidt

We determine generalized symmetries for 4D theories engineered via type II strings on non-supersymmetric orbifold backgrounds $\mathbb{R}^{3,1} \times \mathbb{R}^6 / \Gamma$. Probe branes detect generalized symmetries via the adjacency…

High Energy Physics - Theory · Physics 2025-02-17 Noah Braeger , Vivek Chakrabhavi , Jonathan J. Heckman , Max Hübner

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

Geometric Topology · Mathematics 2017-07-27 Nickolas A. Castro , David T. Gay , Juanita Pinzón-Caicedo

This work identifies a class of moves on knots which translate to $m$-equivalences of the associated $p$-fold branched cyclic covers, for a fixed $m$ and any $p$ (with respect to the Goussarov-Habiro filtration.) These moves are applied to…

Geometric Topology · Mathematics 2007-05-23 Andrew Kricker

Dynamic graphs arise in a plethora of practical scenarios such as social networks, communication networks, and financial transaction networks. Given a dynamic graph, it is fundamental and essential to learn a graph representation that is…

Machine Learning · Computer Science 2021-06-15 Menglin Yang , Ziqiao Meng , Irwin King

The study of sorting permutations by block interchanges has recently been stimulated by a phenomenon observed in the genome maintenance of certain ciliate species. The result was the identification of a block interchange operation that…

Combinatorics · Mathematics 2019-04-09 C. A. Brown , C. S. Carrillo Vazquez , R. Goswami , S. Heil , M. Scheepers

For a given pair of maps f,g:X->M from an arbitrary topological space to an n-manifold, the Lefschetz homomorphism is a certain graded homomorphism L:H(X)->H(M) of degree (-n). We prove a Lefschetz-type coincidence theorem: if the Lefschetz…

Algebraic Topology · Mathematics 2007-05-23 Peter Saveliev

The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…

Algebraic Geometry · Mathematics 2009-09-25 András Némethi

We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…

Combinatorics · Mathematics 2018-02-28 Katja Mönius , Jörn Steuding , Pascal Stumpf

Symplectic four-manifolds give rise to Lefschetz fibrations, which are determined by monodromy representations of free groups in mapping class groups. We study the topology of Lefschetz fibrations by analysing the action of the monodromy on…

Symplectic Geometry · Mathematics 2007-05-23 Ivan Smith

A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by moving some of the vertices. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to turn $\delta$ into a plane…

Computational Geometry · Computer Science 2008-11-06 Xavier Goaoc , Jan Kratochvil , Yoshio Okamoto , Chan-Su Shin , Alexander Wolff

We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…

Geometric Topology · Mathematics 2025-12-02 Benjamin Audoux , Jean-Baptiste Meilhan , Akira Yasuhara