English
Related papers

Related papers: Unifying duality theorems for width parameters in …

200 papers

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…

Logic in Computer Science · Computer Science 2023-04-27 Wojciech Przybyszewski

Two new classes of metrizable vector bundles have been presented in the papers [1] and [4]. The Lie algebroid generalized tangent bundle of a dual vector bundle is presented. This Lie algebroid is a new example of metrizable vector bundle.…

Differential Geometry · Mathematics 2011-09-15 Constantin M. Arcuş

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Group Theory · Mathematics 2022-08-25 Sam Shepherd , Giles Gardam , Daniel J. Woodhouse

In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…

Dynamical Systems · Mathematics 2023-05-04 Alexander Mundey

In this paper we present a geometrical framework to study the uniformity of a composite material by means of double groupoid theory. The notions of vertical and horizontal uniformity are introduced, as well as other weaker ones that allows…

Mathematical Physics · Physics 2025-04-04 V. M. Jiménez , M. De León , M. Epstein

Tangle structure trees, introduced in [3], offer a unified data structure that displays all the tangles of a graph or data set together with certificates for the non-existence of any other tangles, either locally or overall. In this paper…

Combinatorics · Mathematics 2026-03-19 Hanno von Bergen , Reinhard Diestel

Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…

Combinatorics · Mathematics 2023-02-28 Zach Hunter

We introduce the notion of sum-matroids and show its association with sum-rank metric codes. As a consequence, some results for sum-rank metric codes by Mart\'inez-Pe\~nas are generalized for sum-matroids. The sum-matroids generalize the…

Combinatorics · Mathematics 2022-03-23 Avijit Panja , Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

Supplementary comments about generalized Lie algebroids are presented and a new point of view over the construction of the Lie algebroid generalized tangent bundle of a (dual) vector bundle is introduced. Using the general theory of…

Differential Geometry · Mathematics 2014-11-03 E. Peyghan , C. M. Arcuş , L. Nourmohammadifar

We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…

Combinatorics · Mathematics 2011-06-08 Reinhard Diestel , Julian Pott

We discuss generalised duality theory for monoidal categories and its applications to the categories of exact endofunctors, graded vector spaces, and topological vector spaces.

Category Theory · Mathematics 2023-01-25 Stefan Zetzsche

We introduce a general theory of parametrized objects in the setting of infinity categories. Although spaces and spectra parametrized over spaces are the most familiar examples, we establish our theory in the generality of objects of a…

Algebraic Topology · Mathematics 2018-12-19 Matthew Ando , Andrew J. Blumberg , David Gepner

We review remarkable results in several mathematical scenarios, including graph theory, division algebras, cross product formalism and matroid theory. Specifically, we mention the following subjects: (1) the Euler relation in graph theory,…

History and Overview · Mathematics 2011-11-14 J. A. Nieto

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

Combinatorics · Mathematics 2012-10-24 Justin Malestein , Louis Theran

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

Combinatorics · Mathematics 2015-03-17 R. Askanazi , S. Chmutov , C. Estill , J. Michel , P. Stollenwerk

A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…

Combinatorics · Mathematics 2012-10-05 A. Nixon , J. C. Owen , S. C. Power

We introduce a notion of $Q$-algebra that can be considered as a generalization of the notion of $Q$-manifold (a supermanifold equipped with an odd vector field obeying $\{Q,Q\} =0$). We develop the theory of connections on modules over…

High Energy Physics - Theory · Physics 2009-11-07 Albert Schwarz

From the method of realization of bialgebras developped in a preceding paper, we obtain the Duality Theorem and apply it to the study of the ideal of relations for each realized bialgebra. This is detailed in the english version of the…

Quantum Algebra · Mathematics 2007-05-23 Eric Mourre

A notion of an algebroid - a generalization of a Lie algebroid structure is introduced. We show that many objects of the differential calculus on a manifold M associated with the canonical Lie algebroid structure on T^M can be obtained in…

Differential Geometry · Mathematics 2009-10-31 Janusz Grabowski , Pawel Urbanski

We show that there exists only one duality pair for ordered graphs. We will also define a corresponding definition of $\chi^<$-boundedness for ordered graphs and show that all ordered graphs are $\chi^<$-bounded and prove an analogy of…

Combinatorics · Mathematics 2025-12-18 Michal Čertík , Jaroslav Nešetřil