Related papers: The n-point Condition and Rough CAT(0)
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and…
We prove the following rank rigidity result for proper CAT(0) spaces with one-dimensional Tits boundaries: Let $\Gamma$ be a group acting properly discontinuously, cocompactly, and by isometries on such a space $X$. If the Tits diameter of…
It is well known that an $N$-parameter $d$-dimensional Brownian sheet has no $k$-multiple points when $(k-1)d>2kN$, and does have such points when $(k-1)d<2kN$. We complete the study of the existence of $k$-multiple points by showing that…
In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean…
The decoding problem is a ubiquitous algorithmic task in fault-tolerant quantum computing, and solving it efficiently is essential for scalable quantum computing. Here, we prove that minimum-weight decoding is NP-hard in three…
In this work, I consider N-component scalar quantum field theory in two dimensions interacting with an upside-down quartic potential. Working in the large N limit, the model can be solved non-perturbatively using the saddle-point method for…
We say that a system of differential equations d^2x(t)/dt^2=Adx(t)/dt+Bx(t)+Cu(t), in which A and B are m-by-m complex matrices and C is an m-by-n complex matrix, is rigid if it can be reduced by substitutions x(t)=Sy(t),…
An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…
In this paper, we establish some common fixed point results for two pairs of weakly compatible mappings in the setting of $C$-complex valued metric space. Also, as application of the proved result, we obtain the existence and uniqueness of…
Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combinatorial discrepancy. Depending on the ranges, several…
We prove that a random group of the graph model associated with a sequence of expanders has fixed-point property for a certain class of CAT(0) spaces. We use Gromov's criterion for fixed-point property in terms of the growth of n-step…
Let $P$ be a set of $n$ points in $\mathbb{R}^d$ and $\mathcal{F}$ be a family of geometric objects. We call a point $x \in P$ a strong centerpoint of $P$ w.r.t $\mathcal{F}$ if $x$ is contained in all $F \in \mathcal{F}$ that contains more…
We study the gravitational collapse of Type I matter field in $N$ dimensional spacetime with radial pressure $p_{r}$ as a function of $r $. We find that for a given smooth initial data set satisfying physical requirements, naked…
We consider the complexity of Delaunay triangulations of sets of points in R^3 under certain practical geometric constraints. The spread of a set of points is the ratio between the longest and shortest pairwise distances. We show that in…
Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…
Let $N,d > 1$ be fixed integers, let $(T_1, ..., T_N)$ be random d-by-d matrices with nonnegative entries and $Q$ a random d-vector with nonnegative entries. This induces a mapping (the multivariate smoothing transform) on probability laws…
We extend our previous analysis of Riemannian four-manifolds M admitting rigid supersymmetry to N=1 theories that do not possess a U(1)_R symmetry. With one exception, we find that M must be a Hermitian manifold. However, the presence of…
Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…
In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…
We show for $A,B\subset\mathbb{R}^d$ of equal volume and $t\in (0,1/2]$ that if $|tA+(1-t)B|< (1+t^d)|A|$, then (up to translation) $|\text{co}(A\cup B)|/|A|$ is bounded. This establishes the sharp threshold for Figalli and Jerison's…