Related papers: On LP-orientations of cubes and crosspolytopes
We provide an alternative proof of a (local) T1 theorem for dual exponents in the non-homogeneous setting of upper doubling measures. This previously known theorem provides necessary and sufficient conditions for the L^p-boundedness of…
We prove that, apart from some well-known low-dimensional examples, any compact hyperbolic Coxeter polytope has a pair of disjoint facets. This is one of very few known general results concerning combinatorics of compact hyperbolic Coxeter…
We use $L^2$ estimates for the $\bar\partial$ equation to find geometric conditions on discrete interpolating varieties for weighted spaces $A_p(\C)$ of entire functions such that $| f(z)|\le Ae^{Bp(z)}$ for some $A,B>0$. In particular, we…
We prove necessary and sufficient conditions for a smooth surface in a 4-manifold X to be pseudoholomorphic with respect to some almost complex structure on X. This provides a systematic approach to the construction of pseudoholomorphic…
Leighton's graph covering theorem states that two finite graphs with common universal cover have a common finite cover. We generalize this to a large family of non-positively curved special cube complexes that form a natural generalization…
We prove that a PL manifold admits a handle decomposition into handles of index $\le k$ if and only if $M$ is $k$-stacked, i.e., it admits a PL triangulation in which all $(d-k-1)$-faces are on $\partial M$. We use this to solve a problem…
In this paper and its two sequels, we give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in a 2-bridge link complement to be homotopic in the link complement. This paper treats the case when the…
The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $\lceil \log_2 n \rceil$. The Graham-Pollak theorem states that at least $n-1$ bicliques are required to partition the edge set of the…
In this paper we give group-theoretical conditions on the maximal parabolic subgroups of a coset geometry for it to be a chiral hypertope, bypassing the need to construct the incidence graph of the coset geometry to determine whether or not…
The hypercontractivity inequality for the qubit depolarizing channel $\Psi_t$ states that $\|\Psi_t^{\otimes n}(X)\|_p\leq \|X\|_q$ provided that $p\geq q> 1$ and $t\geq \ln \sqrt{\frac{p-1}{q-1}}$. In this paper we present an improvement…
The local Hamiltonian problem is famously complete for the class QMA, the quantum analogue of NP. The complexity of its semi-classical version, in which the terms of the Hamiltonian are required to commute (the CLH problem), has attracted…
Given a closed oriented PL four-manifold $X$ and a closed surface $B$ embedded in $X$ with isolated cone singularities, we give a formula for the signature of an irregular dihedral cover of $X$ branched along $B$. For $X$ simply-connected,…
Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…
The relevance of the single-band two-dimensional Hubbard model to superconductivity in the doped cuprates has recently been questioned, based on Density matrix Renormalization Group (DMRG) computations on extended t-J models that found…
It is known that the gradient descent algorithm converges linearly when applied to a strongly convex function with Lipschitz gradient. In this case the algorithm's rate of convergence is determined by the condition number of the function.…
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the $n!$ Hamilton cycles in a complete directed graph on $n+1$ vertices corresponds with each of the $n!$ $n$-permutation matrices $P$,…
We show that if pn >> log n, the binomial random graph G_{n,p} has an approximate Hamilton decomposition. More precisely, we show that in this range G_{n,p} contains a set of edge-disjoint Hamilton cycles covering almost all of its edges.…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
Criteria for the simplicity of the Lyapunov spectra of linear cocycles have been found by Furstenberg, Guivarc'h-Raugi, Gol'dsheid-Margulis and, more recently, Bonatti-Viana and Avila-Viana. In all the cases, the authors consider cocycles…
We give an example of a function satisfying a two-sided Polyak-Lojasiewicz condition but for which a gradient descent-ascent flow line fails to converge to the saddle point, circling around it instead. We can even impose the function to be…