Related papers: Clean up your Mesh! Part 1: Plane and simplex
Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…
Symmetry is at the heart of much of mathematics, physics, and art. Traditional geometric symmetry groups are defined in terms of isometries of the ambient space of a shape or pattern. If we slightly generalize this notion to allow the…
We compute small rational models for configuration spaces of points on oriented surfaces, as right modules over the framed little disks operad. We do this by splitting these surfaces in unions of several handles. We first describe rational…
Let $\Omega\subset\mathbb{R}^{n+1}$ have minimal Gaussian surface area among all sets satisfying $\Omega=-\Omega$ with fixed Gaussian volume. Let $A=A_{x}$ be the second fundamental form of $\partial\Omega$ at $x$, i.e. $A$ is the matrix of…
Complex geometry and symplectic geometry are mirrors in string theory. The recently developed generalised complex geometry interpolates between the two of them. On the other hand, the classical and quantum mechanics of a finite number of…
A general method is introduced for constructing two-dimensional (2D) surface meshes embedded in three-dimensional (3D) space time, and 3D hypersurface meshes embedded in four-dimensional (4D) space time. In particular, we begin by dividing…
We give a necessary and sufficient smoothness condition for the scheme parameterizing the n-dimensional representations of a finitely generated associative algebra over an algebraically closed field of characteristic zero. In particular,…
It is well known that the SU(2)-gauge invariant phase space of loop gravity can be represented in terms of twisted geometries. These are piecewise-linear-flat geometries obtained by gluing together polyhedra, but the resulting geometries…
The earlier approach is used for description of qubits and geometric phase parameters, the things critical in the area of topological quantum computing. The used tool, Geometric (Clifford) Algebra is the most convenient formalism for that…
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods,…
I will discuss results of three different types in geometry and topology. (1) General vanishing and rigidity theorems of elliptic genera proved by using modular forms, Kac-Moody algebras and vertex operator algebras. (2) The computations of…
We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…
The volume cut off by a hyperplane from a bounded body with smooth boundary in $R^{2k}$ never is an algebraic function on the space of hyperplanes: for k=1 it is the famous lemma XXVIII from Newton's Principia. Following an analogy of these…
The investigation of the relation among the distances of an arbitrary point in the Euclidean space $\mathbb{R}^n$ to the vertices of a regular $n$-simplex in that space has led us to the study of simplices having a regular facet. Calling an…
The well-behaved representations of the coordinate algebra of a 2-dimensional quantum complex plane are classified and a C*-algebra is defined which can be viewed as the algebra of continuous functions on the 2-dimensional quantum complex…
This is an introduction to the geometry of compact Riemann surfaces, largely following the books Farkas-Kra, Fay, Mumford Tata lectures. 1) Defining Riemann surfaces with atlases of charts, and as locus of solutions of algebraic equations.…
This paper lays the foundations for a unified framework for numerically and computationally applying methods drawn from a range of currently distinct geometrical approaches to statistical modelling. In so doing, it extends information…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…
The symmetry of polygons can be characterized by the number of symmetry axes they have. For $n$-polygons with $p$ or $p^2$ vertices $p\geq3$ there exist few symmetry categories, depending from the number of symmetry-axes the have. Further…
We consider two algebras of curves associated to an oriented surface of finite type - the cluster algebra from combinatorial algebra, and the skein algebra from quantum topology. We focus on generalizations of cluster algebras and…