相关论文: On multiple connectedness of regions visible due t…
We prove an unexpected general relation between the Jacobian syzygies of a projective hypersurface $V\subset \mathbb{P}^n$ with only isolated singularities and the nature of its singularities. This allows to establish a new method for the…
The linking integral is an invariant of the link-type of two manifolds immersed in a Euclidean space. It is shown that the ordinary Gauss integral in three dimensions may be simplified to a winding number integral in two dimensions. This…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
A linear system of real quadratic forms defines a real projective variety. The real non-singular locus of this variety (more precisely of the underlying scheme) has a highly connected double cover as long as each non-zero form in the system…
The model of a ring threaded by the Aharonov-Bohm flux underlies our understanding of a coupling between gauge potentials and matter. The typical formulation of the model is based upon a single particle picture, and should be extended when…
Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening,…
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of…
We explore the problem of $M$-guarding polygons with holes using $k$-visibility guards, where a set of guards is said to $M$-guard a polygon if every point in the polygon is visible to at least $M$ guards, with the constraint that there may…
We show how to represent a simple polygon $P$ by a grid (pixel-based) polygon $Q$ that is simple and whose Hausdorff or Fr\'echet distance to $P$ is small. For any simple polygon $P$, a grid polygon exists with constant Hausdorff distance…
The ring of projective invariants of eight ordered points on the line is a quotient of the polynomial ring on V, where V is a fourteen-dimensional representation of S_8, by an ideal I_8, so the modular fivefold (P^1)^8 // GL(2) is Proj(Sym*…
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…
Multiport network theory has been proved to be a suitable abstraction model for analyzing and optimizing reconfigurable intelligent surfaces (RISs) in an electromagnetically consistent manner, especially for studying the impact of the…
A directed graph G (V, E) is strongly connected if and only if, for a pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is…
Given a projective algebraic set X, its dual graph G(X) is the graph whose vertices are the irreducible components of X and whose edges connect components that intersect in codimension one. Hartshorne's connectedness theorem says that if…
A foliation is R-covered if the leaf space in the universal cover is homeomorphic to the real numbers. We show that, up to topological conjugacy, there are at most two pseudo-Anosov flows transverse to such a foliation. If there are two,…
In this work we prove uniqueness result for an implicit discrete system defined on connected graphs. Our discrete system is motivated from a certain class of spatial segregation of reaction-diffusion equations.
For any pair of edges $e,f$ of a graph $G$, we say that {\em $e,f$ are $P_3$-connected in $G$} if there exists a sequence of edges $e=e_0,e_1,\ldots, e_k=f$ such that $e_i$ and $e_{i+1}$ are two edges of an induced $3$-vertex path in $G$…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected…