相关论文: Counting Unique-Sink Orientations
Uniform Lie algebras are combinatorially defined two-step nilpotent Lie algebras which can be used to define Einstein solvmanifolds. These Einstein spaces often have nontrivial isotropy groups. We derive basic properties of uniform Lie…
Pseudoalgebras, introduced in [BDK], are multi-dimensional analogues of conformal algebras, which provide an axiomatic description of the singular part of the operator product expansion. Our main interest in this paper is the pseudoalgebra…
Recent advancements in the synthesis of anisotropic macromolecules and nanoparticles have spurred an immense interest in theoretical and computational studies of self-assembly. The cornerstone of such studies is the role of shape in…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
The local Euler obstructions and the Euler characteristics of linear sections with all hyperplanes on a stratified projective variety are key geometric invariants in the study of singularity theory. Despite their importance, in general it…
Splines are central objects for the interpolation of discrete data via piecewise smooth paths. Their iterated-integral signature is an infinite collection of tensors which characterizes paths almost uniquely. We study truncations of this…
We give some new characterizations of unitaries, isometries, unital operator spaces, unital function spaces, operator systems, C*-algebras, and related objects. These characterizations only employ the vector space and operator space…
We study unit disk visibility graphs, where the visibility relation between a pair of geometric entities is defined by not only obstacles, but also the distance between them. That is, two entities are not mutually visible if they are too…
We study the symmetry groups and winding numbers of planar curves obtained as images of weighted sums of exponentials. More generally, we study the image of the complex unit circle under a finite or infinite Laurent series using a…
We construct finite-dimensional projective representations of the mapping class groups of compact connected oriented surfaces having one boundary component using stated skein algebras.
We study isolated points on the modular curves $X_{H}$, for $H$ a subgroup of $\operatorname{GL}_{2}(\mathbb{Z}/n \mathbb{Z})$ for some $n \geq 1$. In particular, we prove a single-sink theorem for such isolated points, which traces the…
We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph $G$ with positive edge lengths and $k$ pairs of distinct vertices $(s_1, t_1), \dots, (s_k, t_k)$ called terminals, and we want to…
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…
A dimension formula was given in [1] in order to partially classify the Lie algebras of $S$-unitary type. The natural question of when $\mathfrak{u}_{S}$ and $\mathfrak{u}_{T}$ are isomorphic is left unanswered. In this article, we will…
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…
Unsupervised anomaly detection is often framed around two widely studied paradigms. Deep one-class classification, exemplified by Deep SVDD, learns compact latent representations of normality, while density estimators realized by…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and…
Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…