Related papers: On arithmetical structures on K9

We study hyperplane sections of smooth polarized $K3$-surfaces that split into unions of lines. We describe the dual adjacency graphs of such sections and find sharp upper bounds on their number. In most cases (starting from degree $6$), we…

This paper is originally designed as a part of revision of the author's preprint math.AG/9908174 "P-adic Schwarzian triangle groups of Mumford type". Recently, Yves Andr'e pointed out a flaw in that preprint; more precisely, Proposition II…

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…

We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…

The author surveys the problem of piecing together integral or rational solutions to Diophantine equations (global structure) from solutions modulo congruences and real solutions (local structure).

Using a result of Vdovina, we may associate to each complete connected bipartite graph $\kappa$ a $2$-dimensional square complex, which we call a tile complex, whose link at each vertex is $\kappa$. We regard the tile complex in two…

This note presents the basic mathematical structure of a new integer factorization method based on systems of linear Diophantine equations.

Let $k$ be a field of characteristic $p>0$ not necessarily perfect. Using Berthelot's theory of arithmetic $\mathcal{D}$-modules, we construct a $p$-adic formalism of Grothendieck's six operations for realizable $k$-schemes of finite type.

A fundamental characteristic of computer networks is their topological structure. The question of the description of the structural characteristics of computer networks represents a problem that is not completely solved. Search methods for…

We study several extensions of the notion of perfect graphs to $k$-uniform hypergraphs.

Algebraic K-theory is the stable homotopy theory of homotopy theories, and it interacts with algebraic structures accordingly. In particular, we prove the Deligne Conjecture for algebraic K-theory.

We review recent developments in the arithmetic of K3 surfaces. Our focus lies on aspects of modularity, Picard number and rational points. Throughout we emphasise connections to geometry.

Continued fractions have a long history in number theory, especially in the area of Diophantine approximation. The aim of this expository paper is to survey the main results on the theory of $p$--adic continued fractions, i.e. continued…

The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learning algorithms are described for vertex covers, independent…

We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…

Given a simple undirected graph, one can construct from it a $c$-step nilpotent Lie algebra for every $c \geq 2$ and over any field $K$, in particular also over the real and complex numbers. These Lie algebras form an important class of…

We construct a calculus structure on the Lie conformal algebra cochain complex. By restricting to degree one chains, we recover the structure of a g-complex introduced in [DSK]. A special case of this construction is the variational…

We prove the extremal function for $K_9^=$ minors, where $K_9^=$ denotes the complete graph $K_9$ with two edges removed. In particular, we show that any graph with $n$ vertices and at least $6n - 20$ edges either contains a $K_9^=$ minor…

The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…

The fractional arboricity of a digraph $D$, denoted by $\gamma(D)$, is defined as $\gamma(D)= \max_{H \subseteq D, |V(H)| >1} \frac {|A(H)|} {|V(H)|-1}$. Frank in [Covering branching, Acta Scientiarum Mathematicarum (Szeged) 41 (1979),…