Arithmetic Laplacians

We develop an arithmetic analogue of elliptic partial differential equations. The role of the space coordinates is played by a family of primes, and that of the space derivatives along the various primes are played by corresponding Fermat quotient operators subjected to certain commutation relations. This leads to arithmetic linear partial differential equations on algebraic groups that are analogues of certain operators in analysis constructed from Laplacians. We classify all such equations on one-dimensional groups, and analyze their spaces of solutions.     

Graph equations for line graphs,total graphs,middle graphs and quasi-total graphs

Let G be a graph with vertex-set V(G) and edge-set X(G). Let L(G) and T(G) denote the line graph and total graph of G. The middle graph M(G) of G is an intersection graph Ω(F) on the vertex-set V(G) of any graph G. Let F = V′(G) ∪ X(G) where V′(G) indicates the family of all one-point subsets of the set V(G), then $\text{M(G) = Ω(F)}$.The quasi-total graph P(G) of G is a graph with vertex-set V(G)∪X(G) and two vertices are adjacent if and only if they correspond to two non-adjacent vertices of G or to two adjacent edges of G or to a vertex and an edge incident to it in G.In this paper we solve graph equations $\text{L(G) ? P(H);}\text{L(G)}\text{? P(H); P(G) ? T(H);}\text{P(G)}\text{? T(H); M(G) ? P(H);}\text{M(G)}\text{? P(H)}$.     

论数值修约

数值修约的已有定义是从其现象来定义的。现在提出的定义是从数值修约的本质(用加减法使尾数化零)来定义的。因而按定义可直接推导得到种种结论。并可以此来定义各种数值修约规则。对一个数值连续修约的可行性作了解释。对修约间隔亦有论述。本文提出了五轮换规则的想法。关于两个数值修约规则的中文名称,主要是指出它们用常量(四、五、六)表示变量,因而产生逻辑上的错误。本文也讨论产生错误的原因,并同时指出其他错误。新名称的提出已不犯原有错误。     

强算术图

一个（p,q)-图G被为是强（k,d)-算术图,如果存在一个由G的顶点集到模q的整数群Zq的单射,使得相邻两顶点标号的和导出的边值为算术级数,k,k d,……,k (q-1)d,本文讨论了这类标号图的结构和一些性质。     

解读“微积分算术”

2011年在科学网博客上出现的微积分算术,把抽象而高深的微积分看作函数的算术,只用几步高中代数,就能避开极限而又不失严格讲解微积分.首先,用等式讲解多项式的微积分;然后用不等式讲解显式初等函数的微积分.但是,某些读者可能会存在疑问:真的能让微积分的门槛降低,而又不失严格?它到底具备什么样的特点?对学生群体的定位如何?需要进一步的解读,这就是本文的目的.     

Comparability graphs and intersection graphs

A function diagram (f-diagram) D consists of the family of curves {$\text{1}\text{?}$ñ} obtained from n continuous functions $\text{f}{}_{\mathrm{i}}\text{:[0,1]→}\text{R}\text{(1?i?n)}$. We call the intersection graph of D a function graph (f-graph). It is shown that a graph G is an f-graph if and only if its complement ? is a comparability graph. An f-diagram generalizes the notion of a permulation diagram where the f_i are linear functions. It is also shown that G is the intersection graph of the concatenation of ?k permutation diagrams if and only if the partial order dimension of $\text{G}\text{?}\text{is ?k+1}$. Computational complexity results are obtained for recognizing such graphs.     

Clique graphs of time graphs

A simple, finite graph G is called a time graph (equivalently, an indifference graph) if there is an injective real function f on the vertices v(G) such that v_iv_j ∈ e(G) for v_i ≠ v_j if and only if |f(v_i) ? f(v_j)| ≤ 1. A clique of a graph G is a maximal complete subgraph of G. The clique graph K(G) of a graph G is the intersection graph of the cliques of G. It will be shown that the clique graph of a time graph is a time graph, and that every time graph is the clique graph of some time graph. Denote the clique graph of a clique graph of G by K²(G), and inductively, denote K(K^m?1(G)) by K^m(G). Define the index indx(G) of a connected time graph G as the smallest integer n such that Kⁿ(G) is the trivial graph. It will be shown that the index of a time graph is equal to its diameter. Finally, bounds on the diameter of a time graph will be derived.     

Arithmetic monodromy groups

Mathematische Annalen -     

Cover-incomparability graphs and chordal graphs

The problem of recognizing cover-incomparability graphs (i.e. the graphs obtained from posets as the edge-union of their covering and incomparability graph) was shown to be NP-complete in general [J. Maxová, P. Pavlíkova, A. Turzík, On the complexity of cover-incomparability graphs of posets, Order 26 (2009) 229-236], while it is for instance clearly polynomial within trees. In this paper we concentrate on (classes of) chordal graphs, and show that any cover-incomparability graph that is a chordal graph is an interval graph. We characterize the posets whose cover-incomparability graph is a block graph, and a split graph, respectively, and also characterize the cover-incomparability graphs among block and split graphs, respectively. The latter characterizations yield linear time algorithms for the recognition of block and split graphs, respectively, that are cover-incomparability graphs.     

算术与微积分

本文对算术中的度量进行了讨论,定义了度规、微分与度规积分。就像乘除法运算是加减法运算的推广一样,微积分运算是乘除法运算在度规是变量时的推广。     

Arithmetic toric varieties

We study toric varieties over a field k that split in a Galois extension using Galois cohomology with coefficients in the toric automorphism group. Part of this Galois cohomology fits into an exact sequence induced by the presentation of the class group of the toric variety. This perspective helps to compute the Galois cohomology, particularly for cyclic Galois groups. We use Galois cohomology to classify k‐forms of projective spaces when is cyclic, and we also study k‐forms of surfaces.     

Embedding graphs in Cayley graphs

IfY is a finite graph then it is known that every sufficiently large groupG has a Cayley graph containing an induced subgraph isomorphic toY. This raises the question as to what is sufficiently large. Babai and Sós have used a probabilistic argument to show that |G| > 9.5 |Y|³ suffices. Using a form of greedy algorithm we strengthen this to (2 + \sqrt 3 )|Y|^3 $$ " align="middle" border="0"> . Some related results on finite and infinite groups are included.     

Universal graphs and induced-universal graphs

We construct graphs that contain all bounded-degree trees on n vertices as induced subgraphs and have only cn edges for some constant c depending only on the maximum degree. In general, we consider the problem of determining the graphs, so-called universal graphs (or induced-universal graphs), with as few vertices and edges as possible having the property that all graphs in a specified family are contained as subgraphs (or induced subgraphs). We obtain bounds for the size of universal and induced-universal graphs for many classes of graphs such as trees and planar graphs. These bounds are obtained by establishing relationships between the universal graphs and the induced-universal graphs.     

Crossing graphs of fiber-complemented graphs

Fiber-complemented graphs form a vast non-bipartite generalization of median graphs. Using a certain natural coloring of edges, induced by parallelism relation between prefibers of a fiber-complemented graph, we introduce the crossing graph of a fiber-complemented graph G as the graph whose vertices are colors, and two colors are adjacent if they cross on some induced 4-cycle in G. We show that a fiber-complemented graph is 2-connected if and only if its crossing graph is connected. We characterize those fiber-complemented graphs whose crossing graph is complete, and also those whose crossing graph is chordal.     

Crossing graphs of fiber-complemented graphs

Fiber-complemented graphs form a vast non bipartite generalization of median graphs. Using a certain natural coloring of edges, induced by parallelism relation between prefibers of a fiber-complemented graph, we introduce the crossing graph of a fiber-complemented graph G as the graph whose vertices are colors, and two colors are adjacent if they cross on some induced 4-cycle in G. We show that a fiber-complemented graph is 2-connected if and only if its crossing graph is connected. We characterize those fiber-complemented graphs whose crossing graph is complete, and also those whose crossing graph is chordal.