Related papers: From weakly separated collections to matroid subdi…
We report progress in our lattice study of hadronic weak matrix elements relevant for the Delta I = 1/2 rule and epsilon-prime. The presented results are from our first runs on a quenched ensemble with beta=6.0 and a dynamical Nf=2 ensemble…
Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…
Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…
Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $\chi_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or…
We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…
We construct 1-parameter families of non-periodic embedded minimal surfaces of infinite genus in $T \times \mathbb{R}$, where $T$ denotes a flat 2-tori. Each of our families converges to a foliation of $T \times \mathbb{R}$ by $T$. These…
Let $k\leq n$ be positive integers and $\mathbb{Z}_{n}$ be the set of integers modulo $n$. A conjecture of Baranyai from 1974 asks for a decomposition of $k$-element subsets of $\mathbb{Z}_{n}$ into particular families of sets called…
In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…
We present a constructive proof, that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope \beta^k into closed surfaces of genus \leq 1, each with a transitive automorphism group given by the vertex transitive…
The Dressian Dr(k,n) parametrizes all tropical linear spaces, and it carries a natural fan structure as a subfan of the secondaryfan of the hypersimplex \Delta(k,n). We explore the combinatorics of the rays of Dr(k,n), that is, the most…
We introduce a conjecture that we call the {\it Two Hyperplane Conjecture}, saying that an isoperimetric surface that divides a convex body in half by volume is trapped between parallel hyperplanes. The conjecture is motivated by an…
For $ k \in \mathbb{N}$ we introduce an idempotent subalgebra, the spherical partition algebra ${\mathcal{SP} }_{k}$, of the partition algebra ${\mathcal{P} }_{k}$, that we define using an embedding associated with the trivial…
We study the problem of efficient exact partitioning of the hypergraphs generated by high-order planted models. A high-order planted model assumes some underlying cluster structures, and simulates high-order interactions by placing…
We introduce the matroid-minor coalgebra C, which has labeled matroids as distinguished basis, and coproduct given by splitting a matroid into a submatroid and complementary contraction all possible ways. We introduce two new bases for C;…
Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…
We utilize the coherent-constructible correspondence to construct full strongly exceptional collections of nef line bundles in the derived category of a toric variety through the combinatorics of constructible sheaves built from polytopes.…
We prove for all $k\geq 4$ and $1\leq\ell<k/2$ the sharp minimum $(k-2)$-degree bound for a $k$-uniform hypergraph $\mathcal H$ on $n$ vertices to contain a Hamiltonian $\ell$-cycle if $k-\ell$ divides $n$ and $n$ is sufficiently large.…
Hypergraph data are often projected onto a weighted graph by constructing an adjacency matrix whose $(i,j)$ entry counts the number of hyperedges containing both nodes $i$ and $j$. This reduction is computationally convenient, but it can…
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…