Related papers: Negami's like splitting formula for the Jones poly…
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
The Szemer\'edi Regularity Lemma, in combination with the Blow-up Lemma, form the Regularity Method, a fundamental tool in graph embeddings, albeit restricted to very large and dense graphs. We propose an alternative vertex-partitioning…
We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…
We present a linear time algorithm for computing a cycle separator in a planar graph that is (arguably) simpler than previously known algorithms. Our algorithm builds on, and is somewhat similar to, previous algorithms for computing…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
We present a number of new contributions to the topic of constructing efficient higher-order splitting methods for the numerical integration of evolution equations. Particular schemes are constructed via setup and solution of polynomial…
A fractional Adomian decomposition method for fractional nonlinear differential equations is proposed. The iteration procedure is based on Jumarie's fractional derivative. An example is given to elucidate the solution procedure, and the…
We consider Lie and Strang splitting for the time integration of constrained partial differential equations with a nonlinear reaction term. Since such systems are known to be sensitive with respect to perturbations, the splitting procedure…
We propose new Pieri type formulas for Jack polynomials, which is another kind of Pieri type formulas than the ones in the previous paper (G. Shibukawa, arXiv:2004.12875). From these new Pieri type formulas, we give yet another proof of…
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented in block diagonal matrix form (resulting in the Wedderburn decomposition), a general form of polyadic…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
Almost all known secret sharing schemes work on numbers. Such methods will have difficulty in sharing graphs since the number of graphs increases exponentially with the number of nodes. We propose a secret sharing scheme for graphs where we…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
A formula which only involves a partition number and elementary functions is derived by applying Burnside's Lemma to the set of idempotent maps from a set to itself. One side involves a summation over a set closely related to the partition…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
We have new solutions to the Yang-Baxter equation, from which we have constructed new link invariants containing more than two arbitrary parameters. This may be regarded as a generalization of the Jones' polynomial. We have also found…
Let $K[x]$ be a polynomial algebra in a variable $x$ over a commutative $\Q$-algebra $K$, and $\G'$ be the monoid of $K$-algebra monomorphisms of $K[x]$ of the type $\s : x\mapsto x+\l_2x^2+... +\l_nx^n$, $\l_i\in K$, $\l_n$ is a unit of…
We exhibit a numerical method to solve fractional variational problems, applying a decomposition formula based on Jacobi polynomials. Formulas for the fractional derivative and fractional integral of the Jacobi polynomials are proven. By…
This paper provides a general proof of a relationship theorem between nonlinear analogue polynomial equations and the corresponding Jacobian matrix, presented recently by the present author. This theorem is also verified generally effective…
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…