Related papers: A subexponential size triangulation of $\mathbb{R}…

We extend, in significant ways, the theory of truncated boolean representable simplicial complexes introduced in 2015. This theory, which includes all matroids, represents the largest class of finite simplicial complexes for which…

We construct deformations of the small quantum cohomology rings of homogeneous spaces G/P, and obtain an irredundant set of inequalities determining the multiplicative eigenvalue problem for the compact form K of G.

Let $P$ be a convex polyhedron and $Q$ be a convex polygon with $n$ vertices in total in three-dimensional space. We present a deterministic algorithm that finds a translation vector $v \in \mathbb{R}^3$ maximizing the overlap area $|P \cap…

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong…

In this note, we present a new look at translationally equivariant minimal Lagrangian surfaces in the complex projective plane via the loop group method.

Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd characteristic in which $-1$ is not a square. We show that the Fourier extension operator associated with $P$ maps $L^2$ to $L^{r}$ for $r > \frac{32}{9} \approx…

Tensor networks have been an important concept and technique in many research areas, such as quantum computation and machine learning. We study the exponential complexity of contracting tensor networks on two special graph structures:…

In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…

We study the problem of minimum enclosing rectangle with outliers, which asks to find, for a given set of $n$ planar points, a rectangle with minimum area that encloses at least $(n-t)$ points. The uncovered points are regarded as outliers.…

We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a…

We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…

We consider the matching augmentation problem (MAP), where a matching of a graph needs to be extended into a $2$-edge-connected spanning subgraph by adding the minimum number of edges to it. We present a polynomial-time algorithm with an…

We consider a multidimensional universe with the topology $M= \R\times M_1\times \cdots \times M_n$, where the $M_i$ ($i>1$) are $d_i$-dimensional Ricci flat spaces. Exploiting a conformal equivalence between minimal coupling models and…

New expansionary and rotational quadratic forms are constructed for $E^n$-endomorphisms. Relations amongst the various eigenvalues, eigendirections and matrix invariants are established, including propositions on complexity and geometric…

We discuss the local and global problems for the equivalence of geometric structures of an arbitrary order and, in later sections, attention is given to what really matters, namely the equivalence with respect to transformations belonging…

Imposing additional constraints on low-rank optimization has garnered growing interest. However, the geometry of coupled constraints hampers the well-developed low-rank structure and makes the problem intricate. To this end, we propose a…

Miller et al. \cite{MPVX15} devised a distributed\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \cite{MPVX15}.} algorithm in the CONGEST model, that given a parameter $k =…

By making use of the classification of real simple Lie algebra, we get the maximum of the squared length of restricted roots case by case, thus we get the upper bounds of sectional curvature for irreducible Riemannian symmetric spaces of…

We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…

In this paper we study the deformation of strictly convex real projective structures on a closed surface. Specially we study the deformation in terms of the entropy on bulging deformations. As a byproduct we construct a sequence of…