Related papers: Bijective mapping preserving intersecting antichai…
We study transcendental b-divisors over compact K\"ahler manifolds. We establish the correspondence between closed positive currents and nef b-divisors. As an application, we establish the intersection theory of nef b-divisors, answering a…
A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as $r$-Ryser hypergraphs, have been…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
We study a family of graphs related to the $n$-cube. The middle cube graph of parameter $k$ is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube…
We show that for every $d$-dimensional polytope, the hypergraph whose nodes are $k$-faces and whose hyperedges are $(k+1)$-faces of the polytope is strongly $(d-k)$-vertex connected, for each $0 \leq k \leq d- 1$.
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…
We show how to test whether a graph with n vertices and m edges is a partial cube, and if so how to find a distance-preserving embedding of the graph into a hypercube, in the near-optimal time bound O(n^2), improving previous O(nm)-time…
A presheaf of complexes is constructed on a category of weighted finite subsets of a fixed Euclidean space. To each object, a Koszul complex is assigned which resolves the coordinate ring of least squares solutions on that data set for a…
Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…
For $k\ge 3$ and $\epsilon>0$, let $H$ be a $k$-partite $k$-graph with parts $V_1,\dots, V_k$ each of size $n$, where $n$ is sufficiently large. Assume that for each $i\in [k]$, every $(k-1)$-set in $\prod_{j\in [k]\setminus \{i\}} V_i$…
Explicit expressions for the concurrence of all positive and trace-preserving ("stochastic") 1-qubit maps are presented. We construct the relevant convex roof patterns by a new method. We conclude that two component optimal decompositions…
The discrete cube $\{0,1\}^d$ is a fundamental combinatorial structure. A subcube of $\{0,1\}^d$ is a subset of $2^k$ of its points formed by fixing $k$ coordinates and allowing the remaining $d-k$ to vary freely. The subcube structure of…
We study the existence of log-canonical Poisson structures that are preserved by difference equations of special form. We also study the inverse problem, given a log-canonical Poisson structure to find a difference equation preserving this…
This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…
We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 \leq k \leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique…
We study the 3-Calabi-Yau categories $\mathcal{D}$ arising from quivers with potential associated to a decorated marked surface $\mathbf{S}_\bigtriangleup$ introduced by the first author. We prove two conjectures in the prequel, that under…
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of…
The Bitableax correspondence isomorphism/Koszul map Theorem (BCK Theorem, for short, Theorem 6.5 below) describes a relevant pair of mutually inverse vector space isomorphisms, the Koszul map K : U(gl(n))-> Sym(gl(n)) and the bitableaux…
We prove that a quasiisometric map between rank one symmetric spaces is within bounded distance from a unique harmonic map. In particular, this completes the proof of the Schoen-Li-Wang conjecture.
We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n_3 + b n_2 + c n_1 - K is a lower bound for the matching number of every connected subcubic…