Related papers: The structure of delta-matroids with width one twi…

The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…

Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we…

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…

We classify (*)-subgroups of compact Lie groups of adjoint type, and associate a twisted root system to every (*)-subgroup. We study the structure of twisted root system in several aspects: properties of the small Weyl group W_{small} and…

We introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…

We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…

We claim that $M$(atroid) theory may provide a mathematical framework for an underlying description of $M$-theory. Duality is the key symmetry which motivates our proposal. The definition of an oriented matroid in terms of the Farkas…

We study weaker variations of the property of flatness in matroid theory. We show that these variations form a chain of increasingly stronger properties all implying pseudomodularity on its lattice of flats. We show examples in the gammoid…

The group of automorphisms of the geometry of an integrable system is considered. The geometrical structure used to obtain it is provided by a normal form representation of integrable systems that do not depend on any additional geometrical…

Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…

Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…

Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…

Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some…

This paper is devoted to describe the deformations and the elastic energy for structures made of straight rods of thickness $2\delta$ when $\delta$ tends to 0. This analysis relies on the decomposition of the large deformation of a single…

We study the differential and metric structures of the set of real square roots of a non-singular real matrix, under the assumption that the matrix and its square roots are semi-simple, or symmetric, or orthogonal.

We show new algorithms and constructions over linear delta-matroids. We observe an alternative representation for linear delta-matroids, as a contraction representation over a skew-symmetric matrix. This is equivalent to the more standard…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

We present an easy structure theorem for graphs which do not admit an immersion of the complete graph. The theorem motivates the definition of a variation of tree decompositions based on edge cuts instead of vertex cuts which we call…

Protein folds are built primarily from the packing together of two types of structures: alpha-helices and beta-sheets. Neither structure is rigid, and the flexibility of helices and sheets is often important in determining the final fold…