Related papers: On Rigid, Hard and Soft Problems and Results in Ar…
We investigate the homotopy type of a certain homogeneous space for a simple complex algebraic group. We calculate some of its classical topological invariants and introduce a new one. We also propose several conjectures about its…
Length spectral rigidity is the question of under what circumstances the geometry of a surface can be determined, up to isotopy, by knowing only the lengths of its closed geodesics. It is known that this can be done for negatively curved…
We review various combinatorial applications of field theoretical and matrix model approaches to equilibrium statistical physics involving the enumeration of fixed and random lattice model configurations. We show how the structures of the…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
Soft set theory and rough set theory are mathematical tools to deal with uncertainties. In [3], authors combined these concepts and introduced soft rough sets. In this paper, we introduce the concepts of soft rough graphs, vertex and edge…
We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…
This is a survey article about recent developments in dimension-free estimates for maximal functions corresponding to the Hardy--Littlewood averaging operators associated with convex symmetric bodies in $\mathbb R^d$ and $\mathbb Z^d$.
We prove some boundary rigidity results for the hemisphere under a lower bound for Ricci curvature. The main result can be viewed as the Ricci version of a conjecture of Min-Oo.
New Hardy type inequalities in sectorial area and as a limit in an exterior of a ball are proved. Sharpness of the inequalities is shown as well.
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
This article investigates the subject of rigid compact complex manifolds. First of all we investigate the different notions of rigidity (local rigidity, global rigidity, infinitesimal rigidity, etale rigidity and strong rigidity) and the…
We review the following subjects: 1. Basic theory on algebraic curves and their moduli space, 2. Schottky uniformization theory of Riemann surfaces, and its extension called arithmetic uniformization theory, 3. Application to these theories…
A well-known combinatorial algorithm can decide generic rigidity in the plane by determining if the graph is of Pollaczek-Geiringer-Laman type. Methods from matroid theory have been used to prove other interesting results, again under the…
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
We obtain non-Euclidean versions of classical theorems due to Hardy and Littlewood concerning smoothness of the boundary function of an analytic mapping on the unit disk with an appropriate growth condition.
Exploiting the special features of four-dimensional Riemannian geometry, we derive topological and rigidity results for hypersurfaces immersed in space forms of dimension 5. First, we provide a complete description of the Weyl tensor for…
In this paper, we consider radial symmetry property of positive solutions of an integral equation arising from some higher order semi-linear elliptic equations on the whole space $\mathbf{R}^n$. We do not use the usual way to get symmetric…
We describe a convex relaxation for the Gilbert-Steiner problem both in $R^d$ and on manifolds, extending the framework proposed in [9], and we discuss its sharpness by means of calibration type arguments. The minimization of the resulting…
The concept of matrix rigidity was introduced by Valiant(independently by Grigoriev) in the context of computing linear transformations. A matrix is rigid if it is far(in terms of Hamming distance) from any matrix of low rank. Although we…
Understanding, finding, or even deciding on the existence of real solutions to a system of equations is a very difficult problem with many applications. While it is hopeless to expect much in general, we know a surprising amount about these…