Related papers: Resonantly Equivalent Catacondensed Even Ring Syst…
It was recently shown that under mild assumptions second-order conformally superintegrable systems can be encoded in a $(0,3)$-tensor, called structure tensor. For abundant systems, this approach led to algebraic integrability conditions…
Accurate single-cell analysis is critical for diagnostics, immunomonitoring, and cell therapy, but coincident events - where multiple cells overlap in a sensing zone - can severely compromise signal fidelity. We present a hybrid framework…
This paper analyses the construction of the kernel graph of a non-synchronizing transformation semigroup and introduces the inverse synchronization problem. Given a transformation semigroup $S\leq T_n$, we construct the kernel graph…
In this paper, perfect k-orthogonal colourings of tensor graphs are studied. First, the problem of determining if a given graph has a perfect 2-orthogonal colouring is reformulated as a tensor subgraph problem. Then, it is shown that if two…
We present a systematic design method for a cylindrical conformal array of rectangular waveguide-fed metasurfaces. The conformal metasurface consists of multiple curved rectangular waveguides loaded with metamaterial elements\textemdash…
Kempe equivalence is a classical and fundamental notion in graph coloring theory. In the present paper we establish a connection between Kempe equivalence and quadratic stable set ring, which are toric rings associated to graphs. In fact,…
A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring. In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same…
We prove various estimates for the asymptotics of counting functions associated to point sets of coherent frames and Riesz sequences. The obtained results recover the necessary density conditions for coherent frames and Riesz sequences for…
The knots-quivers correspondence states that various characteristics of a knot are encoded in the corresponding quiver and the moduli space of its representations. However, this correspondence is not a bijection: more than one quiver may be…
It is shown that graphs that generalize the ADE Dynkin diagrams and have appeared in various contexts of two-dimensional field theory may be regarded in a natural way as encoding the geometry of a root system. After recalling what are the…
A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…
In this paper we give a complete characterization of the statistical equivalence classes of CEGs and of staged trees. We are able to show that all graphical representations of the same model share a common polynomial description. Then,…
This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…
We consider a Bose-Einstein condensate (BEC), which is characterized by long-range and anisotropic dipole-dipole interactions and vanishing s-wave scattering length, in a double-well potential. The properties of this system are investigated…
While motivated by structural problems in mathematical music theory, this article introduces a novel combinatorial framework that advances the classification of cyclic cubic bipartite graphs. We extend the classical study of Levi graphs by…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
Binary disordered systems are usually obtained by mixing two ingredients in variable proportions: conductor and insulator, or conductor and super-conductor. and are naturally modeled by regular bi-dimensional or tri-dimensional lattices, on…