相关论文: Non-crossing frameworks with non-crossing reciproc…

In this work, we solve the problem of finding non-intersecting paths between points on a plane with a new approach by borrowing ideas from geometric topology, in particular, from the study of polygonal schema in mathematics. We use a…

This work extends the theory of reciprocal diagrams in graphic statics to frameworks that are invariant under finite group actions by utilizing the homology and representation theory of cellular cosheaves, recent tools from applied…

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

The triangulations of a surface $\Sigma$ with a prescribed set of vertices can be endowed with a graph structure $\mathcal{F}(\Sigma)$. Its edges connect two triangulations that differ by a single arc. It is known that, when $\Sigma$ is a…

In this paper, we study Hamiltonian stationary Lagrangian surfaces in complex space forms. We first show that when the mean curvature is a non-zero constant, the second fundamental form is parallel. We then consider the case in which the…

In magnetic trilayer systems, spin pumping is generally addressed as a reciprocal mechanism characterized by one unique spin mixing conductance common to both interfaces. However, this assumption is questionable in cases where different…

We show how non-reciprocal ferromagnetic interactions between neighbouring planar spins in two dimensions, affect the behaviour of topological defects. Non-reciprocity is introduced by weighting the coupling strength of the two-dimensional…

We study the scaling properties of forced folding of thin materials of different geometry. The scaling relations implying the topological crossovers from the folding of threedimensional plates to the folding of two-dimensional sheets, and…

Given a graph drawn in the plane, the degenerate crossing number of the drawing is the number of points in the plane which are contained in the relative interior of at least two edges, where each edge is required to be drawn as a simple…

The aim of the paper is to define noncommutative cluster structure on several algebras ${\mathcal A}$ related to marked surfaces possibly with orbifold points of various orders, which includes noncommutative clusters, i.e., embeddings of a…

Despite the success of deep functional maps in non-rigid 3D shape matching, there exists no learning framework that models both self-symmetry and shape matching simultaneously. This is despite the fact that errors due to symmetry mismatch…

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

Planar Embedding is a drawing of a graph on the plane such that the edges do not intersect each other except at the vertices. We know that testing the planarity of a graph and computing its embedding (if it exists), can efficiently be…

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…

Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as…

A graph $G$ is called matching covered if all of its edges are contained in some perfect matching of $G$. Furthermore, a cycle $C \subseteq G$ is called conformal if $G - V(C)$ has a perfect matching and $G$ itself is called cycle-conformal…

We study pseudo-classical knots in the non-orientable thickening of a non-orientable surface, specifically knots that are orientation-preserving paths in a non-orientable $3$-manifold of the form (non-orientable surface) $\times$ $[0, 1]$.…

To investigate the impact of non-linear interactions on dynamic coarse graining, we study a simplified model system, featuring a tracer particle in a complex environment. Using a projection operator formalism and computer simulations, we…

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…