Related papers: Order-Degree-Height Surfaces for Linear Operators

It is well-known that every convex function admits an affine support at every interior point of a domain. Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree…

In this paper, we define both the upper and lower order of a sense-preserving harmonic mapping in $\mathbb{D}$. We generalize to the harmonic case some known results about holomorphic functions with positive lower order and we show some…

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

Starting from Rodrigues formula we present a general construction of raising and lowering operators for orthogonal polynomials of continuous and discrete variable on uniform lattice. In order to have these operators mutually adjoint we…

In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…

In this article we discuss the convergence of first order operators on a thickened graph (a graph-like space) towards a similar operator on the underlying metric graph. On the graph-like space, the first order operator is of the form…

In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…

The aim of this paper is to construct a Riemann-Lagrange geometry on 1-jet spaces, in the sense of d-connections, d-torsions, d-curvatures, electromagnetic d-field and geometric electromagnetic Yang-Mills energy, starting from a given…

We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…

A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…

In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.

We develop and test high-order methods for integration on surface point clouds. The task of integrating a function on a surface arises in a range of applications in engineering and the sciences, particularly those involving various integral…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Let $F(x_1,...,x_n)$ be a form of degree $d\geq 2$, which produces a geometrically irreducible hypersurface in $\mathbb{P}^{n-1}$. This paper is concerned with the number of rational points on F=0 which have height at most $B$. Whenever…

We provide explicit bounds on the difference of heights of isogenous Drinfeld modules. We derive a finiteness result in isogeny classes. In the rank 2 case, we also obtain an explicit upper bound on the size of the coefficients of modular…

In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…

We show that on an arbitrary collection of objects there is a wide variety of higher order architectures governed by hyperstructures. Higher order gluing, local to global processes, fusion of collections, bridges and higher order types are…

We define the concept of higher order differential operators on a general noncommutative, nonassociative superalgebra A, and show that a vertex operator superalgebra has plenty of them, namely modes of vertex operators. A linear operator…