Related papers: Over then Under Tangles
The article is devoted to microbundles over topological rings. Their structure, homomorphisms, automorphisms and extensions are studied. Moreover, compactifications and inverse spectra of microbundles over topological rings are…
Counting the number of triangles in a graph has many important applications in network analysis. Several frequently computed metrics like the clustering coefficient and the transitivity ratio need to count the number of triangles in the…
The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance "Bruss odds" to obtain…
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…
Model rotation is an efficient technique for improving MUS finding algorithms. In previous work we have studied model rotation as an algorithm that traverses a graph which is induced by the input formula. This document introduces the notion…
Hypergraphs offer a generalized framework for understanding complex systems, covering group interactions of different orders beyond traditional pairwise interactions. This modelling allows for the simplified description of simultaneous…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
The ability to generalize out-of-domain (OOD) is an important goal for deep neural network development, and researchers have proposed many high-performing OOD generalization methods from various foundations. While many OOD algorithms…
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…
We explore the ideas of open-closed-open triality within twisted holography. Starting from two transverse stacks of branes in the B-model on the resolved conifold, we obtain two equivalent open string descriptions. Both are full-fledged…
When mathematical/computational problems reach infinity, extending analysis and/or numerical computation beyond it becomes a notorious challenge. We suggest that, upon suitable singular transformations (that can in principle be…
One can see deep-learning models as compositions of functions within the so-called tame geometry. In this expository note, we give an overview of some topics at the interface of tame geometry (also known as o-minimality), optimization…
The theory of linear transports along paths in vector bundles, generalizing the parallel transports generated by linear connections, is developed. The normal frames for them are defined as ones in which their matrices are the identity…
We explicitly determine the group of isomorphism classes of equivariant line bundles on the non-archimedean Drinfeld upper half plane for $\mathrm{GL}_2(F)$, for its subgroups of matrices whose determinant has even (respectively trivial)…
Drinfel'd double of Lie bialgebroids plays an important role in T-duality of string theories. In the presence of $H$ and $R$ fluxes, Lie bialgebroids should be extended to proto Lie bialgebroids. For both cases, the pair is given by two…
The paper glosses different forms of an introducing of higher order tangent-like functors, especially functors derived from higher order nonholonomic tangent functors. A special attention is devoted to higher order osculating bundles: their…
In a temporal network with discrete time-labels on its edges, entities and information can only ``flow'' along sequences of edges whose time-labels are non-decreasing (resp. increasing), i.e. along temporal (resp. strict temporal) paths.…
The power and flexibility of Optimal Transport (OT) have pervaded a wide spectrum of problems, including recent Machine Learning challenges such as unsupervised domain adaptation. Its essence of quantitatively relating two probability…
Node representation learning in a network is an important machine learning technique for encoding relational information in a continuous vector space while preserving the inherent properties and structures of the network. Recently,…
The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back…