English
Related papers

Related papers: Chart description for hyperelliptic Lefschetz fibr…

200 papers

We consider some smooth maps on a bouquet of circles. For these maps we can compute the number of fixed points, the existence of periodic points and an exact formula for topological entropy. We use Lefschetz fixed point theory and actions…

Dynamical Systems · Mathematics 2007-05-23 Jaume Llibre , Michael Todd

The Arakelov--Parshin rigidity theorem implies that a holomorphic Lefschetz fibration $\pi: M \to S^2$ of genus $g \geq 2$ admits only finitely many holomorphic sections $\sigma:S^2 \to M$. We show that an analogous finiteness theorem does…

Geometric Topology · Mathematics 2024-09-24 Seraphina Eun Bi Lee , Carlos A. Serván

Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph…

Social and Information Networks · Computer Science 2023-09-20 Paul Rosen , Mustafa Hajij , Bei Wang

We obtain infinitely many (non-conjugate) representations of 3-manifold fundamental groups into a lattice in the holomorphic isometry group of complex hyperbolic space. The lattice is an orbifold fundamental group of a branched covering of…

Geometric Topology · Mathematics 2023-11-23 Ruben Dashyan

Let $\Fth$ be a $\Bk$-graph on a single vertex. We show that every irreducible atomic $*$-representation is the minimal $*$-dilation of a group construction representation. It follows that every atomic representation decomposes as a direct…

Operator Algebras · Mathematics 2008-04-25 Kenneth R. Davidson , Dilian Yang

We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…

Combinatorics · Mathematics 2022-11-15 Xizhi Liu , Dhruv Mubayi , Christian Reiher

There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…

Data Structures and Algorithms · Computer Science 2023-07-24 Michael G. Rawson , Audun Myers , Robert Green , Michael Robinson , Cliff Joslyn

We describe Lefschetz-Bott fibrations on complex line bundles over symplectic manifolds explicitly. As an application, we construct more than one strong symplectic filling of the link of the $A_{k}$-type singularity. In the appendix, we…

Geometric Topology · Mathematics 2019-04-02 Takahiro Oba

This is a summary of some of the basic facts about flat 2-orbifold groups, otherwise known as 2-dimensional crystallographic groups. We relate the geometric and topological presentations of these groups, and consider structures…

Group Theory · Mathematics 2017-08-15 J. A. Hillman

We study the Lebwohl-Lasher model for systems in which spin are arranged on random graph lattices. At equilibrium our analysis follows the theory of spin-systems on random graphs which allows us to derive exact bifurcation conditions for…

Disordered Systems and Neural Networks · Physics 2009-11-11 N. S. Skantzos , J. P. L. Hatchett

We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph to…

Human-Computer Interaction · Computer Science 2021-04-23 Youjia Zhou , Archit Rathore , Emilie Purvine , Bei Wang

We present an approach to constructing broken Lefschetz fibrations (BLFs) $f:X\rightarrow S^2$ from a handle decomposition of a 4-manifold $X$. Given a handle decomposition as input these techniques yield explicit descriptions of the BLFs,…

Geometric Topology · Mathematics 2015-12-01 Mark C. Hughes

We prove two general decomposition theorems for fixed-point invariants: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar additivity results for these invariants. Moreover, the proofs of…

Algebraic Topology · Mathematics 2017-09-28 Kate Ponto , Michael Shulman

We propose a graphical notation by which certain spectral properties of complex systems can be rewritten concisely and interpreted topologically. Applying this notation to analyze the stability of a class of networks of coupled dynamical…

Adaptation and Self-Organizing Systems · Physics 2012-05-16 Anne-Ly Do , Stefano Boccaletti , Thilo Gross

We describe a new relation between the topology of hyperplane arrangements, Milnor fibers and global polar curves, via the affine Lefschetz theory developped by A. N\'emethi. In particular, we improve some results due to Orlik and Terao…

Algebraic Geometry · Mathematics 2007-05-23 A. Dimca

We treat the problem of characterizing in a systematic way the qualitative features of two-dimensional dynamical systems. To that end, we construct a representation of the topological features of phase portraits by means of diagrams that…

Chaotic Dynamics · Physics 2018-06-29 Javier Roulet , Gabriel B. Mindlin

We develop a technique for gluing relative trisection diagrams of $4$-manifolds with nonempty connected boundary to obtain trisection diagrams for closed $4$-manifolds. As an application, we describe a trisection of any closed $4$-manifold…

Geometric Topology · Mathematics 2020-01-10 Nickolas A. Castro , Burak Ozbagci

We prove that any genus-2 Lefschetz fibration without reducible fibers and with ``transitive monodromy'' is holomorphic. The latter condition comprises all cases where the number of singular fibers is not congruent to 0 modulo 40. An…

Symplectic Geometry · Mathematics 2007-05-23 Bernd Siebert , Gang Tian

A matrix formalism is proposed for computations based on Picard--Lefschetz theory in a 2D case. The formalism is essentially equivalent to the computation of the intersection indices necessary for the Picard--Lefschetz formula and enables…

Mathematical Physics · Physics 2025-12-22 A. V. Shanin , A. I. Korolkov , N. M. Artemov , R. C. Assier

We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…

Discrete Mathematics · Computer Science 2019-12-30 Yidan Zhang , Xiaolong Huang , Zhipeng Xu , Yuefan Deng