Related papers: Unifying duality theorems for width parameters in …
We address a question posed by Fessler-Jensen-Kelsey-Owen regarding graphs whose second gonality is greater than the first by exactly 1. We answer the question affirmatively under a stronger condition, thereby characterising the entire…
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that the branchwidth of connected hypergraphs without bridges and…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
This is the first in a series of papers that deals with duality statements such as Mukai-duality (T-duality, from algebraic geometry) and the Baum-Connes conjecture (from operator $K$-theory). These dualities are expressed in terms of…
This expository article delves into the Greenlees-May Duality Theorem which is widely thought of as a far-reaching generalization of the Grothendieck's Local Duality Theorem. This theorem is not addressed in the literature as it merits and…
In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…
Ando's theorem states that any pair of commuting contractions on a Hilbert space can be dilated to a pair of commuting unitaries. Parrott presented an example showing that an analogous result does not hold for a triple of pairwise commuting…
The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an…
We prove a duality theorem for certain graded algebras and show by various examples different kinds of failure of tameness of local cohomology.
This paper generalizes Shelah's generic pair conjecture (now theorem) for the measurable cardinal case from first order theories to finite diagrams. We use homogeneous models in the place of saturated models.
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
The theory of linear transports along paths in vector bundles, generalizing the parallel transports generated by linear connections, is developed. The normal frames for them are defined as ones in which their matrices are the identity…
We introduce a comprehensive data structure, tangle structure trees, which simultaneously displays all the $\mathcal{F}$-tangles of an abstract separation system for very general obstruction sets $\mathcal{F}$. It simultaneously also…
In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a…
A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…
In this article we summarize and extend the ideas and investigations on so called target space dualities of heterotic models with (0,2) worldsheet supersymmetry as they were partly presented on the String-Math 2011 conference. After the…