Related papers: Partial cubes: structures, characterizations, and …

Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…

We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…

We consider relationships between cubic algebras and implication algebras. We first exhibit a functorial construction of a cubic algebra from an implication algebra. Then we consider an collapse of a cubic algebra to an implication algebra…

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…

We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that remove a single vertex. Moreover, we give a cubic time…

We study random composite structures considered up to symmetry that are sampled according to weights on the inner and outer structures. This model may be viewed as an unlabelled version of Gibbs partitions and encompasses multisets of…

We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…

We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…

Denote by Q_d the d-dimensional hypercube. Addressing a recent question we estimate the number of ways the vertex set of Q_d can be partitioned into vertex disjoint smaller cubes. Among other results, we prove that the asymptotic order of…

A lucasene is a hexagon chain that is similar to a fibonaccene, an $L$-fence is a poset the Hasse diagram of which is isomorphic to the directed inner dual graph of the corresponding lucasene. A new class of cubes, which named after…

New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.

This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local…

For a partial lattice L the so-called two-point extension is defined in order to extend L to a lattice. We are motivated by the fact that the one-point extension broadly used for partial algebras does not work in this case, i.e. the…

We introduce the notion of a symmetric basis of a vector space equipped with a quadratic form, and provide a sufficient and necessary condition for the existence to such a basis. Symmetric bases are then used to study Cayley graphs of…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…

Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…