Related papers: Circle arrangements of link projections
Packing problems, even of objects with regular geometries, are in general non-trivial. For few special shapes, the features of crystalline as well as random, irregular two-dimensional (2D) packings are known. The packing of 2D crosses does…
Coupled cluster theory is the method of choice for weakly correlated systems. But in the strongly correlated regime, it faces a symmetry dilemma, where it either completely fails to describe the system, or has to artificially break certain…
A twisted ring is a ring endowed with a family of endomorphisms satisfying certain relations. One may then consider the notions of twisted module and twisted differential module. We study them and show that, under some general hypothesis,…
Let K and L be disjoint closed oriented submanifolds of the n-sphere, with dimensions adding up to n-1. We define a map from their join K*L to the n-sphere whose degree up to sign equals their linking number, and then use this to find the…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
The relationship between orientation-to-alignment conversion (a form of atomic polarization evolution induced by an electric field) and the phenomenon of spin squeezing is demonstrated. A "stretched" state of an atom or molecule with…
Working over a field ${\mathbb{k}}$ of characteristic $\ne 2$, we study what we call bisector fields, which are arrangements of paired lines in the plane that have the property that each line in the arrangement crosses the paired lines in…
An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…
Random Projection is a foundational research topic that connects a bunch of machine learning algorithms under a similar mathematical basis. It is used to reduce the dimensionality of the dataset by projecting the data points efficiently to…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
We define an 'oriented convex region' as a convex region with a direction of symmetry. An earlier article had touched upon isosceles triangles, rectangles and ellipses. Here, we examine some more possible oriented containers - semicircles,…
A list of different types of a projective line over non-commutative rings with unity of order up to thirty-one inclusive is given. Eight different types of such a line are found. With a single exception, the basic characteristics of the…
We show that any smooth one-dimensional link in the real projective three-plane is the fixed-point locus of a smooth symplectic surface in the complex projective three-plane which is invariant under complex conjugation. The degree of the…
Geometrical meaning of superstring pictures is discussed in details. An off-shell generalization of the picture changing operation and its inverse are constructed. It is demonstrated that the generalised operations are inverse to each other…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…
We describe an example of a structurally stable heteroclinic network for which nearby orbits exhibit irregular but sustained switching between the various sub-cycles in the network. The mechanism for switching is the presence of spiralling…
We describe rings over which every right module is almost injective. We give a description of rings over which every simple module is a almost projective.
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…