Related papers: Negami's like splitting formula for the Jones poly…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
The present author recently proposed and proved a relationship theorem between nonlinear polynomial equations and the corresponding Jacobian matrix. By using this theorem, this paper derives a Newton iterative formula without requiring the…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
If $G$ is a countable, discrete group generated by two finite subgroups $H$ and $K$ and $P$ is a II$_1$ factor with an outer G-action, one can construct the group-type subfactor $P^H \subset P \rtimes K$ introduced in \cite{BH}. This…
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the original vertex. We introduce and study vertex splitting as a…
This work proposes a new model in the context of statistical theory of shape, based on the polar decomposition. The non isotropic noncentral elliptical shape distributions via polar decomposition is derived in the context of zonal…
According to the Weinstein splitting theorem, any Poisson manifold is locally, near any given point, a product of a symplectic manifold with another Poisson manifold whose Poisson structure vanishes at the point. Similar splitting results…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph $G$ is a decomposition $\mathcal{D}$ of $G$ such that every subgraph $H \in \mathcal{D}$ is locally irregular.…
Kirigami are part of the larger class of mechanical metamaterials, which exhibit exotic properties. This article focuses on rhombi-slits, which is a specific type of kirigami. A nonlinear kinematic model was previously proposed as a second…
We describe the implementation of the Giudici-Green Metropolis sampling method for decomposable graphs using a variety of structures to represent the graph. These comprise the graph itself, the Junction tree, the Almond tree and the Ibarra…
A geometrical approach to the calculation of N-point Feynman diagrams is reviewed. It is shown that the geometrical splitting yields useful connections between Feynman integrals with different momenta and masses. It is demonstrated how…
This paper provides a general operadic definition for the notion of splitting the operations of algebraic structures. This construction is proved to be equivalent to some Manin products of operads and it is shown to be closely related to…
We investigate coincidences of the (one-variable) Jones polynomial amongst rational knots, what we call `Jones rational coincidences'. We provide moves on the continued fraction expansion of the associated rational which we prove do not…
The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…
Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…
After revisiting Cantor-Zassenhaus polynomial factorization algorithm, we describe a new simplified version of it, which requires less computational cost. Moreover we show that it is able to find a factor of a fully splitting polynomial of…
In this paper we propose an Almansi-type decomposition for slice regular functions of several quaternionic variables. Our method yields $2^n$ distinct and unique decompositions for any slice function with domain in $\mathbb{H}^n$. Depending…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…