Related papers: A note on monomials
We show optimal existence, nonexistence and regularity results for nonnegative solutions to Dirichlet problems as $$ \begin{cases} \displaystyle -\Delta_1 u = g(u)|D u|+h(u)f & \text{in}\;\Omega,\\ u=0 & \text{on}\;\partial\Omega,…
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
We ask for a given system of polynomials f_1,...,f_n and f over the complex numbers when there exist continuous functions q_1,...,q_n such that q_1 f_1+...+q_n f_n = f. This condition defines the continuous closure of an ideal. We give…
Let F be a field and let G be a finite graph with a total ordering on its edge set. Richard Stanley noted that the Stanley-Reisner ring F(G) of the broken circuit complex of G is Cohen-Macaulay. Jason Brown gave an explicit description of a…
This paper is devoted to the study of meromorphic solutions of nonlinear differential equations, specifically the equation \[ (f^n)^{(k)}(g^n)^{(k)} = \alpha^2, \] where $k$ and $n$ are positive integers with $n>2k$, and $\alpha$ is a…
The purpose of this paper is to study the properties of the solutions to the biharmonic equations: $\Delta(\Delta f)=g$, where $g:$ $\overline{\mathbb{D}}\rightarrow\mathbb{C}$ is a continuous function and $\overline{\mathbb{D}}$ denotes…
${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…
In this paper we extend a recent result of Collin-Rosenberg ({\it a solution to the minimal surface equation in the Euclidean disc has radial limits almost everywhere}) to a large class of differential operators in Divergence form.…
We find all polynomials f,g,h over a field K such that g and h are linear and f(g(x))=h(f(x)). We also solve the same problem for rational functions f,g,h, in case the field K is algebraically closed.
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…
Combining probabilistic and analytic tools from potential theory, we investigate Dirichlet problems associated with the Dunkl Laplacian $\Delta_k$. We establish, under some conditions on the open set $D\subset\R^d$, the existence of a…
We study the postcritically finite non-polynomial map $f(x)=\frac{1}{(x-1)^2}$ over a number field $k$ and prove various results about the geometric $G^{\text{geom}}(f)$ and arithmetic $G^{\text{arith}}(f)$ iterated monodromy groups of $f$.…
We study some size estimates for the solution of the equation d-bar u=f in one variable. The new ingredient is the use of holomorphic functions with precise growth restrictions in the construction of explicit solutions to the equation.
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…
This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…
For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…
In the paper, we deal with the problem of getting analytic continuations for the monomial function associated with a solution to the reduced trinomial algebraic system. In particular, we develop the idea of applying the Mellin-Barnes…
Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…
Inspired by Viennot's observation that matching polynomials are numerators of branched continued fractions we present a proof of the Heilmann-Lieb Theorem.
A class $\mathcal G$ of graphs is $\chi$-bounded if there is a function $f$ such that for every graph $G\in \mathcal G$ and every induced subgraph $H$ of $G$, $\chi(H)\le f(\omega(H))$. In addition, we say that $\mathcal G$ is polynomially…