相关论文: Periodic binary harmonic functions

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

We formulate and prove a combinatorial criterion to decide if an A-hypergeometric system of differential equations has a full set of algebraic solutions or not. This criterion generalises the so-called interlacing criterion in the case of…

Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the…

A vector field s on a Riemannian manifold M is said to be harmonic if there exists a member of a 2-parameter family of generalised Cheeger-Gromoll metrics on TM with respect to which s is a harmonic section. If M is a simply-connected…

A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chromatic numbers of all algebraic hypergraphs are determined,…

For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a graph $G$,…

For a given point P in the group of K-rational points E(K) of an elliptic curve, we consider the sequence of values (F_1(P),F_2(P),F_3(P),...) of the division polynomials of E at P. If K is a finite field, we prove that the sequence is…

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

In this note we consider $k$-regular multigraphs, where the possible edge multiplicities are controlled. These structures are considered in a question recently posed by Brendan McKay. We express the generating functions using the scalar…

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

Let PG be the Proth-Gilbreath operator that transforms a sequence of integers into the sequence of the absolute values of the differences between all pairs of neighbor terms. Consider the infinite tables obtained by successive iterations of…

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

A result of Monsky states that the Hilbert-Kunz function of a one-dimensional local ring of prime characteristic has a term $\phi$ that is eventually periodic. For example, in the case of a power series ring in one variable over a…

We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…

In this paper we continue work in the direction of a characterization of rational period functions on the Hecke groups. We examine the role that Hecke-symmetry of poles plays in this setting, and pay particular attention to non-symmetric…

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1\cdots n_k\le x} F(n_1,\ldots,n_k)$, taken over the hyperbolic region $\{(n_1,\ldots,n_k)\in {\Bbb N}^k: n_1\cdots n_k\le x\}$, where $F:{\Bbb N}^k\to {\Bbb C}$ is a given…

A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).

The harmonic polylogarithms (hpl's) are introduced. They are a generalization of Nielsen's polylogarithms, satisfying a product algebra (the product of two hpl's is in turn a combination of hpl's) and forming a set closed under the…

We consider a polyharmonic operator $H=(-\Delta)^l+V(x)$ in dimension two with $l\geq 6$ and a limit-periodic potential $V(x)$. We prove that the spectrum of $H$ contains a semiaxis and there is a family of generalized eigenfunctions at…