English
Related papers

Related papers: On $Z$-monodromies in embedded graphs

200 papers

We give a complete topological classification of germs of holomorphic foliations in the plane under rather generic conditions. The key point is the introduction of a new topological invariant called monodromy representation. This monodromy…

Dynamical Systems · Mathematics 2012-06-12 David Marín , Jean-François Mattei

We find normal forms for del Pezzo surfaces of degree $2$ over algebraically closed fields of characteristic $2$. For each normal form, we describe the structure of the group of automorphisms of the surface. In particular, we classify all…

Algebraic Geometry · Mathematics 2023-05-19 Igor Dolgachev , Gebhard Martin

We introduce a zeta function of digraphs that determines, and is determined by, the spectra of all linear combinations of the adjacency matrix, its transpose, the out-degree matrix, and the in-degree matrix. In particular, zeta-equivalence…

Spectral Theory · Mathematics 2015-05-15 Peter Herbrich

Consider the family of smooth cubic surfaces which can be realized as threefold-branched covers of $\mathbb{P}^{2}$, with branch locus equal to a smooth cubic curve. This family is parametrized by the space $\mathcal{U}_{3}$ of smooth cubic…

Algebraic Geometry · Mathematics 2021-05-17 Adán Medrano Martín del Campo

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Combinatorics · Mathematics 2010-02-14 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

Combinatorics · Mathematics 2015-03-25 Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco , Sanming Zhou

We prove that $i)$ if $\mathcal{A}$ is $\lambda $-accessible and it is axiomatizable in (finitary) coherent logic then $\lambda $-pure maps are strict monomorphisms and $ii)$ if there is a proper class of strongly compact cardinals and…

Category Theory · Mathematics 2025-06-05 Kristóf Kanalas

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

Logic in Computer Science · Computer Science 2024-11-20 Jonathan Prieto-Cubides , Håkon Robbestad Gylterud

The monodromy conjecture is an umbrella term for several conjectured relationships between poles of zeta functions, monodromy eigenvalues and roots of Bernstein-Sato polynomials in arithmetic geometry and singularity theory. Even the…

Algebraic Geometry · Mathematics 2022-03-30 Alexander Esterov , Ann Lemahieu , Kiyoshi Takeuchi

We describe the subgroup of the mapping class group of a hypersurface in $\mathbb{CP}^4$ consisting of those diffeomorphisms which can be realised by monodromy.

Algebraic Topology · Mathematics 2025-01-22 Oscar Randal-Williams

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

Discrete Mathematics · Computer Science 2015-06-17 Pavel Klavík , Peter Zeman

We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.

Combinatorics · Mathematics 2007-05-23 Michael A. van Opstall , Razvan Veliche

A permutation graph $G_\pi$ is a simple graph with vertices corresponding to the elements of $\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every…

We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…

Logic in Computer Science · Computer Science 2023-08-01 Malin Altenmüller , Ross Duncan

When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…

Combinatorics · Mathematics 2016-08-30 Klavdija Kutnar , Dragan Marusic

We classify simple parametrisations of complex curve singularities. Simple means that all neighbouring singularities fall in finitely many equivalence classes. We take the neighbouring singularities to be the ones occurring in the versal…

Algebraic Geometry · Mathematics 2018-12-12 Jan Stevens

By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we classify the nonorientable regular embeddings of the…

Combinatorics · Mathematics 2011-07-19 Gareth A. Jones , Young Soo Kwon

Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…

Group Theory · Mathematics 2017-08-08 Sang-hyun Kim , Thomas Koberda , Juyoung Lee

We study monodromies of plane curve singularities and pseudo-periodic homeomorphisms of oriented surfaces with boundary, following an original idea of the first author: t\^ete-\`a-t\^ete graphs and twists. We completely characterize mapping…

Geometric Topology · Mathematics 2019-12-30 Norbert A'Campo , Javier Fernandez de Bobadilla , Maria Pe Pereira , Pablo Portilla Cuadrado

It is well-known that every 3-connected planar graph has a unique planar embedding on the sphere. We study the extension to triangulated 1-planar graphs, T1P graphs for short, which admit an embedding in which each edge is crossed at most…

Discrete Mathematics · Computer Science 2023-12-27 Franz J. Brandenburg
‹ Prev 1 8 9 10 Next ›