Related papers: Point Charges and Polygonal Linkages

We find the critical charge for a topologically massive gauge theory for any gauge group, generalising our earlier result for SU(2). The relation between critical charges in TMGT, singular vectors in the WZNW model and logarithmic CFT is…

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

Topological Weyl semimetals have been attracting broad interest. Recently, a new type of Weyl point with topological charge of $4$, termed as charge-4 Weyl point (C-4 WP), was proposed in spinless systems. Here, we show the minimum symmetry…

We study the minimizer u of a convex functional in the plane which is not G\^ateaux-differentiable. Namely, we show that the set of critical points of any C^1-smooth minimizer can not have isolated points. Also, by means of some appropriate…

Quantum entanglement can be an effective diagnostic tool for probing topological phases protected by global symmetries. Recently, the notion of nontrivial topology in critical systems has been proposed and is attracting growing attention.…

We use methods of approximation theory to find the absolute minima on the sphere of the potential of spherical $(2m-3)$-designs with a non-trivial index $2m$ that are contained in a union of $m$ parallel hyperplanes, $m\geq 2$, whose…

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. The orbit of a convex polygon under this map is a sequence of polygons which converges…

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

In this paper, we show that for a unicritical polynomial having a priori bounds, the unique conformal measure of minimal exponent has no atom at the critical point. For a conformal measure of higher exponent, we give a necessary and…

We consider the Monge problem of optimal transport between a compactly supported source measure and a target probability measure with unbounded support. We consider the convergence of optimal maps and potential functions when the target…

We derive model-independent lower bounds on the stress tensor central charge C_T in terms of the operator content of a 4-dimensional Conformal Field Theory. More precisely, C_T is bounded from below by a universal function of the dimensions…

Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is with two…

Two fluid configurations along a flow are conjugate if there is a one parameter family of geodesics (fluid flows) joining them to infinitesimal order. Geometrically, they can be seen as a consequence of the (infinite dimensional) group of…

We study the interplay of topological excitations in stripe phases: charge dislocations, charge loops, and spin vortices. In two dimensions these defects interact logarithmically on large distances. Using a renormalization-group analysis in…

A planar graph $G$ is called a pentagulation of an $n$-gon ($n\geq$ is an integer) if all faces of $G$ are pentagons, except one, which is an $n$-gon. A $3$-connected pentagulation $G$ of an $n$-gon is called minimal if it has the smallest…

In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…

Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right…

Pure {\it compact} $U(1)$ lattice gauge theory exhibits a phase transition at gauge coupling $g \sim {\cal{O}}(1)$ separating a familiar weak coupling Coulomb phase, having free massless photons, from a strong coupling phase. However, the…