Related papers: On arithmetical structures on K9
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where…
The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…
We describe explicitly the algebras of degree zero operations in connective and periodic p-local complex K-theory. Operations are written uniquely in terms of certain infinite linear combinations of Adams operations, and we give formulas…
Starting from a recently-introduced algebraic structure on spin foam models, we define a Hopf algebra by dividing with an appropriate quotient. The structure, thus defined, naturally allows for a mirror analysis of spin foam models with…
General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible…
This paper is the ninth in a sequence on the structure of sets of solutions to systems of equations in free and hyperbolic groups, projections of such sets (Diophantine sets), and the structure of definable sets over free and hyperbolic…
We employ the mathematical programming approach in conjunction with the graph theory to study the structure of correspondent banking networks. Optimizing the network requires decisions to be made to onboard, terminate or restrict the bank…
For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k.
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
In the 1990s, J.H. Conway published a combinatorial-geometric method for analyzing integer-valued binary quadratic forms (BQFs). Using a visualization he named the "topograph," Conway revisited the reduction of BQFs and the solution of…
In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations…
Let $\mathcal{G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of $\mathcal{G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to $\mathcal{G}.$ We denote by $\mathcal{A}_k…
K-geodetic graphs (K capital) are defined as graphs in which each pair of nonadjacent vertices has at most K paths of minimum length between them. A K-geodetic graph is geodetic if K=1, bigeodetic if K=2 and trigeodetic if K=3. K-geodetic…
A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields.…
Let I(p,v) be Bourdon's building, the unique simply-connected 2-complex such that all 2-cells are regular right-angled hyperbolic p-gons and the link at each vertex is the complete bipartite graph K(v,v). We investigate and mostly determine…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
The goal of the work is to take on and study one of the fundamental tasks studying Diophantine n-gons (the author of the paper considers an integral n-gon is Diophantine as far as determination of combinatorial properties of each of them…
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced and studied strong subgraph $k$-connectivity of digraphs obtaining characterizations, lower and upper bounds and computational complexity results for the new digraph…
Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…