Related papers: The structure of delta-matroids with width one twi…
In previous work we derived the topological terms in the M-theory action in terms of certain characters that we defined. In this paper, we propose the extention of these characters to include the dual fields. The unified treatment of the…
We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the…
The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural criterion of the underlying graph that enables tractable…
A Delta-groupoid is an algebraic structure which axiomatizes the combinatorics of a truncated tetrahedron. By considering two simplest examples coming from knot theory, we illustrate how can one associate a Delta-groupoid to an ideal…
The theoretical study of deformability of special sequence of DNA double helix TATA-box is presentated. The paper elaborates on the mechanisms of abnormal deformation of DNA TATA-box double helix that cannot be explained using the standard…
We show that the basis graph of an even delta-matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges $e$ and $f$ sharing a common end, it has a Hamiltonian cycle using $e$ and avoiding…
Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We…
An ordered structure is called o-minimalistic if it has all the first-order features of an o-minimal structure. We propose a theory, DCTC (Definable Completeness/Type Completeness), that describes many properties of o-minimalistic…
The present work is the first member of a pair of papers concerning decreasingly-minimal (dec-min) elements of a set of integral vectors, where a vector is dec-min if its largest component is as small as possible, within this, the next…
A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…
We generalize theories of graph, matroid, and ribbon-graph activities to delta-matroids. As a result, we obtain an activities based feasible-set expansion for a transition polynomial of delta-matroids defined by Brijder and Hoogeboom. This…
The closure conditions of the inexact exterior differential form and dual form (an equality to zero of differentials of these forms) can be treated as a definition of some differential-geometrical structure. Such a connection discloses the…
The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…
Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
We explore the symmetry structure of Type II Little String Theories and their T-dualities. We construct these theories both from the bottom-up perspective starting with seed Superconformal Field Theories, and from the top-down using…