English
Related papers

Related papers: Residue polytopes

200 papers

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

Group Theory · Mathematics 2020-05-01 Andrea Lucchini

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Combinatorics · Mathematics 2009-09-02 Dainis Zeps

Let $X$ be a smooth, pointed Riemann surface of genus zero, and $G$ a simple, simply-connected complex algebraic group. Associated to a finite number of weights of $G$ and a level is a vector space called the space of conformal blocks, and…

Algebraic Geometry · Mathematics 2016-08-04 Michael Schuster

We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…

Computational Geometry · Computer Science 2022-08-31 Radoslav Fulek , Jan Kynčl

A separation of a graph $G$ is a partition $(A_1, A_2, C)$ of $V(G)$ such that $A_1$ is anticomplete to $A_2$. A classic result from Robertson and Seymour's Graph Minors Project states that there is a correspondence between tree…

Combinatorics · Mathematics 2022-07-25 Tara Abrishami

We introduce a polynomial invariant of graphs on surfaces, $P_G$, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for $P_G$, analogous to the duality for the Tutte…

Combinatorics · Mathematics 2015-03-13 Vyacheslav Krushkal

A travel groupoid is an algebraic system satisfying two suitable conditions, which has a relation to graphs. In this article, we characterize travel groupoids on finite complete multipartite graphs, and we give the numbers of travel…

Combinatorics · Mathematics 2024-12-10 Diogo Kendy Matsumoto

A bipartite covering of a (multi)graph $G$ is a collection of bipartite graphs, so that each edge of $G$ belongs to at least one of them. The capacity of the covering is the sum of the numbers of vertices of these bipartite graphs. In this…

Combinatorics · Mathematics 2023-08-01 Noga Alon

Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…

Combinatorics · Mathematics 2023-10-13 Deborah Oliveros , Érika Roldán , Pablo Soberón , Antonio J. Torres

Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of…

Combinatorics · Mathematics 2025-03-11 Markus Bläser , Yinan Li , Youming Qiao , Alexander Rogovskyy

A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit…

Combinatorics · Mathematics 2018-12-12 Daniel Pellicer , Primož Potočnik , Micael Toledo

We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…

Combinatorics · Mathematics 2022-12-22 Brendan D. McKay , Fiona Skerman

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…

Discrete Mathematics · Computer Science 2017-06-06 Manuel Aprile , Yuri Faenza , Samuel Fiorini , Tony Huynh , Marco Macchia

Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…

Computational Geometry · Computer Science 2026-04-20 Jean Cardinal , Micha Sharir

In this paper we prove geometric residue theorems for bundle maps over a compact manifold. The theory developed associates residues to the singularity submanifolds of the map for any invariant polynomial. The theory is then applied to a…

dg-ga · Mathematics 2008-02-03 Sunil Nair

For Grassmann varieties, we explain how the duality between the Gelfand-Tsetlin polytopes and the Feigin-Fourier-Littelmann-Vinberg polytopes arises from different positive structures.

Combinatorics · Mathematics 2020-03-10 Xin Fang , Ghislain Fourier

An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. Examples of chiral polytopes have been difficult to find. A "mixing" construction…

Combinatorics · Mathematics 2012-01-17 Gabe Cunningham

A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…

Combinatorics · Mathematics 2021-02-11 Vinod Kumar , Krishnendra Shekhawat

We describe moduli spaces of logarithmic rank $2$ connections on elliptic curves with $n \geq 1$ poles and generic residues. In particular, we generalize a previous work by the first and second named authors. Our main approach is to analyze…

Algebraic Geometry · Mathematics 2022-05-31 Thiago Fassarella , Frank Loray , Alan Muniz

We associate to any endomorphism of the punctured affine space over some field an element in the Witt group of the base field that we call degree. We use this degree to give a counter-example to a question on unimodular rows

Commutative Algebra · Mathematics 2012-09-27 Jean Fasel