Related papers: Lower bounds and integrality gaps in simplicial de…

Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of…

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.

In recent years, the expander decomposition method was used to develop many graph algorithms, resulting in major improvements to longstanding complexity barriers. This powerful hammer has led the community to (1) believe that most problems…

We develop the method of inducing semiorthogonal decompositions of projective varieties with isolated rational singularities from those of small resolutions of singularities, which generalizes semiorthogonal decompositions for singular…

For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…

Let $(T,\langle \cdot, \cdot, \cdot \rangle)$ be a Leibniz triple system of arbitrary dimension, over an arbitrary base field ${\mathbb F}$. A basis ${\mathcal B} = \{e_{i}\}_{i \in I}$ of $T$ is called multiplicative if for any $i,j,k \in…

An $(\epsilon,\phi)$-expander decomposition of a graph $G=(V,E)$ is a clustering of the vertices $V=V_{1}\cup\cdots\cup V_{x}$ such that (1) each cluster $V_{i}$ induces subgraph with conductance at least $\phi$, and (2) the number of…

For $d \geq 2$, Walkup's class ${\cal K}(d)$ consists of the $d$-dimensional simplicial complexes all whose vertex-links are stacked $(d-1)$-spheres. Kalai showed that for $d \geq 4$, all connected members of ${\cal K}(d)$ are obtained from…

We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products…

A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…

This article deals with topological assumptions under which the minimal volume entropy of a closed manifold, and more generally of a finite simplicial complex, vanishes or is positive. In the first part of the article, we present…

Let $X$ be a finite type simply connected rationally elliptic CW-complex with Sullivan minimal model $(\Lambda V, d)$ and let $k\geq 2$ the biggest integer such that $d=\sum_{i\geq k}d_i$ with $d_i(V)\subseteq \Lambda ^iV$. We show that:…

Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…

We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Str{\o}mme [WG 2016] who gave a kernel with $\mathcal{O}(|X|^{12})$ vertices when $X$ is a…

We give an explicit construction of vertex-transitive tight triangulations of $d$-manifolds for $d\geq 2$. More explicitly, for each $d\geq 2$, we construct two $(d^2+5d+5)$-vertex neighborly triangulated $d$-manifolds whose vertex-links…

We call a finite-dimensional K-algebra A geometrically irreducible if for all d all connected components of the affine scheme of d-dimensional A-modules are irreducible. We prove that a geometrically irreducible algebra with exactly two…

In this paper we introduce Crouzeix-Raviart elements of general polynomial order $k$ and spatial dimension $d\geq2$ for simplicial finite element meshes. We give explicit representations of the non-conforming basis functions and prove that…

We prove a relatively simple combinatorial characterization of simplicial $d$-spheres on $d+4$ vertices. Our criteria are given in terms of the intersection patterns of a simplicial complex's family of minimal non-faces. Namely, let…

We study integrality gap (IG) lower bounds on strong LP and SDP relaxations derived by the Sherali-Adams (SA), Lovasz-Schrijver-SDP (LS+), and Sherali-Adams-SDP (SA+) lift-and-project (L&P) systems for the t-Partial-Vertex-Cover (t-PVC)…

A $K_4$-decomposition of a graph is a partition of its edges into $K_4$s. A fractional $K_4$-decomposition is an assignment of a nonnegative weight to each $K_4$ in a graph such that the sum of the weights of the $K_4$s containing any given…