Related papers: Forcing minimal patterns of triods
In this paper we present a detailed study of \emph{bonded knots} and their related structures, integrating recent developments into a single framework. Bonded knots are classical knots endowed with embedded bonding arcs modeling physical or…
In this article, we study a non-uniform distribution on permutations biased by their number of records that we call \emph{record-biased permutations}. We give several generative processes for record-biased permutations, explaining also how…
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…
Unitarity is a fundamental property of any theory required to ensure we work in a theoretically consistent framework. In comparison with the quark sector, experimental tests of unitarity for the 3x3 neutrino mixing matrix are considerably…
A fundamental theorem of Laman characterises when a bar-joint framework realised generically in the Euclidean plane admits a non-trivial continuous deformation of its vertices. This has recently been extended in two ways. Firstly to…
We describe some asymptotic properties of trigonometric skew-product maps over irrational rotations of the circle. The limits are controlled using renormalization. The maps considered here arise in connection with the self-dual Hofstadter…
Fully Packed Loop configurations in a triangle (TFPLs) first appeared in the study of ordinary Fully Packed Loop configurations (FPLs) on the square grid where they were used to show that the number of FPLs with a given link pattern that…
This paper investigates first-order variable metric backward forward dynamical systems associated with monotone inclusion and convex minimization problems in real Hilbert space. The operators are chosen so that the backward-forward…
We develop a new concept of non-positive curvature for metric spaces, based on intersection patterns of closed balls. In contrast to the synthetic approaches of Alexandrov and Buesemann, our concept also applies to metric spaces that might…
We study the motion of a charge on a conformally flat Riemannian torus in the presence of magnetic field. We prove that for any non-zero magnetic field there always exist orbits of this motion which have conjugate points. We conjecture that…
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…
Framing triangulations of unit flow polytopes have received a great deal of recent study with rich connections to various generalizations of Catalan and Cambrian combinatorics as well as volume and h*-polynomial formulas. This story has…
Recently patterns were found in the least significant digits in the logistic map orbits in the chaotic regime. However, the dynamic of these digits was not explored in deep. We propose a new interpretation of the patterns found in the least…
In this work we investigate 5-dimensional theories obtained from M-theory on genus one fibered threefolds which exhibit twisted algebras in their fibers. We provide a base-independent algebraic description of the threefolds and compute…
It is well-known that a nonsingular minimal cubic surface is birationally rigid; the group of its birational selfmaps is generated by biregular selfmaps and birational involutions such that all relations between the latter are implied by…
\emph{Reductions} combine collections of input values with an associative (and usually also commutative) operator to produce either a single, or a collection of outputs. They are ubiquitous in computing, especially with big data and deep…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
In this paper we consider endomorphisms of an undirected cycle graph from Semigroup Theory perspective. Our main aim is to present a process to determine sets of generators with minimal cardinality for the monoids $wEnd(C_n)$ and $End(C_n)$…
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…
Halved monotone triangles are a generalisation of vertically symmetric alternating sign matrices (VSASMs). We provide a weighted enumeration of halved monotone triangles with respect to a parameter which generalises the number of $-1$s in a…