Related papers: Bijective mapping preserving intersecting antichai…

In the present paper we find a bijection between the set of small covers over an $n$-cube and the set of acyclic digraphs with $n$ labeled nodes. Using this, we give a formula of the number of small covers over an $n$-cube (generally, a…

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…

A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if for any two vertices $u,v\in{M}$ there exists a shortest $u$-$v$ path in $G$ that contains no elements of $M$ as internal vertices. Let $\chi_{\mu}(G)$ be the least…

We describe a bijection between oriented cubes and adjoints of cross-polytopes. This correspondence is used to prove that the real affine cube is, up to reorientation in the same class, the unique oriented cube that is realizable. Moreover,…

In this note we recall the relations between the barcodes in level and sub-level persistence and make precise their relation with the Morse-Novikov complex of a Morse real- or angle-valued map. The results in this papers are implicit in my…

In their recent inspiring paper Mironov and Morozov claim a surprisingly simple expansion formula for the Kontsevich-Witten tau-function in terms of the Schur Q-functions. Here we provide a similar conjecture for the Br\'ezin-Gross-Witten…

We prove ``half-space" intersection properties in three settings: the hemisphere, half-geodesic balls in space forms, and certain subsets of Gaussian space. For instance, any two embedded minimal hypersurfaces in the sphere must intersect…

We characterize the structure of the periods of a neuronal recurrence equation. Firstly, we give a characterization of k-chains in 0-1 periodic sequences. Secondly, we characterize the periods of all cycles of some neuronal recurrence…

A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…

Let S be a smooth projective surface, and consider the following two subvarieties of the Hilbert scheme parameterizing closed subschemes of S of length n: A = {subschemes with support in a fixed point of S} B = {subschemes with support in…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

A $k$-bisection of a multigraph $G$ is a partition of its vertex set into two parts of the same cardinality such that every component of each part has at most $k$ vertices. Cui and Liu shown that every claw-free cubic multigraph contains a…

Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of…

The structure of cones of positive and k-positive maps acting on a finite-dimensional Hilbert space is investigated. Special emphasis is given to their duality relations to the sets of superpositive and k-superpositive maps. We characterize…

The following assertion was equivalent to a conjecture proposed by B. Tomaszewski : Let $C$ be an $n$-dimensional unit cube and let $H$ be a plank of thickness $1$, both are centered at the origin, then no matter how to turn the cube…

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

A unit cube in $k$ dimensions ($k$-cube) is defined as the the Cartesian product $R_1\times R_2\times...\times R_k$ where $R_i$(for $1\leq i\leq k$) is a closed interval of the form $[a_i,a_i+1]$ on the real line. A graph $G$ on $n$ nodes…

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…

We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path…