Related papers: Extensions of Scott's Graph Model and Kleene's Sec…
Heterogeneous graphs can well describe the complex entity relationships in the real world. For example, online shopping networks contain multiple physical types of consumers and products, as well as multiple relationship types such as…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…
We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…
Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical…
We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…
We study the structure of an algebraically closed field with extra function resembling the classical exponentiation on complex numbers.
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
Quadratic algebras are generalizations of Lie algebras; they include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical…
This is a short survey illustrating some of the essential aspects of the theory of canonical extensions. In addition some topological results about canonical extensions of lattices with additional operations in finitely generated varieties…
Graph contrastive learning (GCL) has emerged as an effective tool for learning unsupervised representations of graphs. The key idea is to maximize the agreement between two augmented views of each graph via data augmentation. Existing GCL…
The last two decades, since the seminal work of Selig, has seen projective geometric algebra (PGA) gain popularity as a modern coordinate-free framework for doing classical Euclidean geometry and other Cayley-Klein geometries. This…
We provide a unified method to study the adjacency matrices of regular graphs (including infinite ones) using holomorphic functional calculus. By applying this calculus on a specific ellipse that contains the spectrum, we derive an…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such…
Matrix inequalities that extend certain scalar ones have been at the center of numerous researchers' attention. In this article, we explore the celebrated subadditive inequality for matrices via concave functions and present a reversed…
During the past three decades, the advantageous concept of the Green's function has been extended from linear systems to nonlinear ones. At that, there exist a rigorous and an approximate extensions. The rigorous extension introduces the…
We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…
The augmentation variety of a knot is the locus, in the 3-dimensional coefficient space of the knot contact homology dg-algebra, where the algebra admits a unital chain map to the complex numbers. We explain how to express the Alexander…