Related papers: Negami's like splitting formula for the Jones poly…
We propose a new method for numerical calculation of link plynomials for knots given in 3 dimensions. We calculate derivatives of the Jones polynomial in a computational time proportional to $N^{\alpha}$ with respect to the system size $N$…
An algebraic technique is presented that does not use results of model theory and makes it possible to construct a general Galois theory of arbitrary nonlinear systems of partial differential equations. The algebraic technique is based on…
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel…
In this paper we consider splitting methods for the time integration of parabolic and certain classes of hyperbolic partial differential equations, where one partial flow can not be computed exactly. Instead, we use a numerical…
Given a sufficiently large and sufficiently dense bipartite graph $G=(A, B; E),$ we present a novel method for decomposing the majority of the edges of $G$ into quasirandom graphs so that the vertex sets of these quasirandom graphs…
For prime $p$ and small $n$, Jones and Roberts have developed a database recording invariants for $p$-adic extensions of degree $n$. We contributed to this database by computing the Galois slope content, Galois mean slope, and inertia…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the link. The Bollobas-Riordan-Tutte polynomial generalizes the…
We deal with various splitting methods in algebraic logic. The word `splitting' refers to splitting some of the atoms in a given relation or cylindric algebra each into one or more subatoms obtaining a bigger algebra, where the number of…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
We use Feynman diagrams to prove a formula for the Jones polynomial of a link derived recently by N.~Reshetikhin. This formula presents the colored Jones polynomial as an integral over the coadjoint orbits corresponding to the…
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
Recently, the second and third author showed that complete geometric graphs on $2n$ vertices in general cannot be partitioned into $n$ plane spanning trees. Building up on this work, in this paper, we initiate the study of partitioning into…
A new method is introduced for bounding the separation between the value of $-k$ and the smallest eigenvalue of a non-bipartite $k$-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very…
The splitting number of a graph $G=(V,E)$ is the minimum number of vertex splits required to turn $G$ into a planar graph, where a vertex split removes a vertex $v \in V$, introduces two new vertices $v_1, v_2$, and distributes the edges…
We construct parametric families of (monic) reducible polynomials having two roots very close to each other.
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
The Jacobi system on a full-line lattice is considered when it contains additional weight factors. A factorization formula is derived expressing the scattering from such a generalized Jacobi system in terms of the scattering from its…
Tropical geometry is a degeneration of classical geometry which loose the property of unique factorization for polynomials. In this paper we explore a structure that is known to be a semi-degeneration between the classical algebra and the…
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…