Related papers: One-adhesive polymatroids
A Lie groupoid can be thought of as a generalization of a Lie group in which the multiplication is only defined for certain pairs of elements. From another perspective, Lie groupoids can be regarded as manifolds endowed with a type of…
In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It is closely related…
The classical Cauchy rigidity theorem for convex polytopes reads that if two convex polytopes have isometric developments then they are congruent. In other words, we can decide whether two polyhedra are isometric or not by using their…
We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…
We define and study multiplicative connections in the tangent bundle of a Lie groupoid. Multiplicative connections are linear connections satisfying an appropriate compatibility with the groupoid structure. Our definition is natural in the…
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
The present paper is devoted to the study of dimonoids, algebraic structures with two associative binary operations that satisfy a prescribed system of axioms. We investigate the properties of dual dimonoids. In the class of noncommutative…
A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which…
We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…
Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…
We introduce the parametric matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for…
The aim of this paper is to explain, mostly through examples, what groupoids are and how they describe symmetry. We will begin with elementary examples, with discrete symmetry, and end with examples in the differentiable setting which…
Given an infinite subset $\mathcal A \subseteq\mathbb N$, let $A$ denote its smallest $N$ elements. There is a rich and growing literature on the question of whether for typical $\alpha\in[0,1]$, the pair correlations of the set $\alpha A…
Using a transfer matrix technique, we calculate the entropy of polydisperse chains placed on a one-dimensional lattice, as a function of the density of internal and endpoint monomers. The polydispersivity is determined considering different…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop harmonic conjugation in projective rectangles. We construct projective rectangles in some harmonic matroids (matroids where harmonic…
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…
We present a simple model for the possible mechanism of appearance of attraction between like charged polyions inside a polyelectrolyte solution. The attraction is found to be short ranged, and exists only in presence of multivalent…