Related papers: Cuts, flows and gradient conditions on harmonic fu…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A(\Gamma)$ is singular. The singularity of graphs is of certain interest in graph theory and algebraic combinatorics. Here we…

Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a $(2,s,3)$-presentation, that…

This paper studies first the differential inequalities that make it possible to build a global theory of pseudo-holomorphic functions in the case of one or several complex variables. In the case of one complex dimension, we prove that the…

Let G be a group of type FP_n and let p>1. In this paper we show that the reduced l^p-homology of G is dual to the reduced l^q-cohomology for \frac{1}{p}+\frac{1}{q}=1. In our main theorem we show that for a group of type FP_n with a…

In the present paper, we develop geometric analytic techniques on Cayley graphs of finitely generated abelian groups to study the polynomial growth harmonic functions. We develop a geometric analytic proof of the classical Heilbronn theorem…

Let $\Gamma$ be a discrete finitely presented group. Pick any system $S$ of generators in $\Gamma$. In Cayley graph $\mathrm{Cay}(\Gamma)=\mathrm{Cay}(\Gamma, S)$ with edge set $E$, glue with oriented polygons all the group relations…

We collect several results concerning regularity of minimal laminations, and governing the various modes of convergence for sequences of minimal laminations. We then apply this theory to prove that a function has locally least gradient (is…

Let \Fc be a holomorphic foliation by curves defined in a neighborhood of 0 in \C^2 having 0 as a hyperbolic singularity. Let T be a harmonic current directed by \Fc which does not give mass to any of the two separatrices. Then we show that…

We deal with non negative functions satisfying \[ \left\{ \begin{array}{ll} (-\Delta)^s u_s=0 & \mathrm{in}\quad C, u_s=0 & \mathrm{in}\quad \mathbb{R}^n\setminus C, \end{array}\right. \] where $s\in(0,1)$ and $C$ is a given cone on…

We use the inflation-restriction sequence and a result of Etingof and Gra\~na on the rack cohomology to give a explicit description of 2-cocycles of finite indecomposable quandles with values in an abelian group. Several applications are…

The real monomial representations of Clifford algebras give rise to two sequences of bent functions. For each of these sequences, the corresponding Cayley graphs are strongly regular graphs, and the corresponding sequences of strongly…

Let $G$ be a finite non-cyclic group. The non-cyclic graph $\Gamma_G$ of $G$ is the graph whose vertex set is $G\setminus Cyc(G)$, two distinct vertices being adjacent if they do not generate a cyclic subgroup, where $Cyc(G)=\{a\in G:…

Using an rotation of Yuan, we observe that the gradient graph of any semiconvex function is a Liouville manifold, that is, does not admit bounded harmonic functions. As a corollary, we find that any entire solution of the fourth order…

On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…

A claw-free graph is a graph that does not contain $K_{1,3}$ as an induced subgraph, and a 2-factor is a 2-regular spanning subgraph of a graph. In 1997, Ryj\'{a}\v{c}ek introduced the closure concept of claw-free graphs, and Hamilton…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

One of the most interesting problems on maximum nullity (minimum rank) is to characterize $M(\mathcal{G})$ ($mr(\mathcal{G})$) for a graph $\mathcal{G}$. In this regard, many researchers have been trying to find an upper or lower bound for…

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…

The harmonic map energy of a map from a closed, constant-curvature surface to a closed target manifold can be seen as a functional on the space of maps and domain metrics. We consider the gradient flow for this energy. In the absence of…