Related papers: The Harmonic GBC Function Map is a Bijection if th…
Each point of a simplex is expressed as a unique convex combination of the vertices. The coefficients in the combination are the barycentric coordinates of the point. For each point in a general convex polytope, there may be multiple…
In this paper, we investigate the problem of finding {\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\it all} graphs $G$: (1). $G$ has a bisection where each vertex $v$ has at least $(1/4 -…
A subclass of complex-valued close-to-convex harmonic functions that are univalent and sense-preserving in the open unit disc is investigated. The coefficient estimates, growth results, area theorem, boundary behavior, convolution and…
Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…
We use functions of a bicomplex variable to unify the existing constructions of harmonic morphisms from a 3-dimensional Euclidean or pseudo-Euclidean space to a Riemannian or Lorentzian surface. This is done by using the notion of…
We prove that a proper holomorphic map between two bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism. Our methods allow us to give a single, all-encompassing argument that unifies the…
Here is an English summary of the abstract: This research investigates a geometric dynamical mechanism within a specific class of domains that contain a fixed convex core. By using a radial structure that links the boundaries of the core…
We investigate the relationship between the univalence of $f$ and of $h$ in the decomposition $f=h+\bar{g}$ of a sense-preserving harmonic mapping defined in the unit disk $\mathbb{D}\subset\mathbb{C}$. Among other results, we determine the…
The existing definitions of graph convolution, either from spatial or spectral perspectives, are inflexible and not unified. Defining a general convolution operator in the graph domain is challenging due to the lack of canonical…
A wide range of optimization problems can often be written in terms of generalized convex functions (GCFs). When this structure is present, it can convert certain nested bilevel objectives into single-level problems amenable to standard…
We relate the existence problem of harmonic maps into $S^2$ to the convex geometry of $S^2$. On one hand, this allows us to construct new examples of harmonic maps of degree 0 from compact surfaces of arbitrary genus into $S^2$. On the…
Graph Convolutional Networks (GCNs) have shown very powerful for graph data representation and learning tasks. Existing GCNs usually conduct feature aggregation on a fixed neighborhood graph in which each node computes its representation by…
Symbolic regression aims to find a function that best explains the relationship between independent variables and the objective value based on a given set of sample data. Genetic programming (GP) is usually considered as an appropriate…
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…
Numerical experiments with smooth surface extension and image inpainting using harmonic and biharmonic functions are carried out. The boundary data used for constructing biharmonic functions are the values of the Laplacian and normal…
This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…
With advanced X-ray source and detector technologies being continuously developed, non-traditional CT geometries have been widely explored. Generalized-Equiangular Geometry CT (GEGCT) architecture, in which an X-ray source might be…
Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…
We describe a new map-making code for cosmic microwave background (CMB) observations. It implements fast algorithms for convolution and transpose convolution of two functions on the sphere (Wandelt & G\'{o}rski 2001). Our code can account…
We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with a class of geometrically defined nonconvex conic programs…