Related papers: Two characterizations of crooked functions
Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…
The arrow graph of a function consists of two parallel axes, with arrows from input values to output values. The lines through these arrows envelop a curve which we named the focal curve. This paper studies these focal curves in detail. We…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
Over an algebraically closed field of positive characteristic, there exist rational functions with only one critical point. We give an elementary characterization of these functions in terms of their continued fraction expansions. Then we…
Generally speaking, `almost distance-regular' graphs share some, but not necessarily all, of the regularity properties that characterize distance-regular graphs. In this paper we propose two new dual concepts of almost distance-regularity,…
In Two-Sets Cut-Uncut, we are given an undirected graph $G=(V,E)$ and two terminal sets $S$ and $T$. The task is to find a minimum cut $C$ in $G$ (if there is any) separating $S$ from $T$ under the following ``uncut'' condition. In the…
In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…
We compute the minimum distance of the parameterized code of order 1 over an even cycle.
Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…
We study minimax lower bounds for function estimation problems on large graph when the target function is smoothly varying over the graph. We derive minimax rates in the context of regression and classification problems on graphs that…
We introduce two types bilateral zeta functions, which are related to the primitive and normalized multiple sine functions respectively. Further, we establish their main properties, that is, Fourier expansions, analytic continuations,…
People employ the function-on-function regression to model the relationship between two random curves. Fitting this model, widely used strategies include algorithms falling into the framework of functional partial least squares (typically…
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
Two-point correlation functions of spin operators in the minimal models ${{\cal M}}_{p,p'}$ perturbed by the field $\Phi_{13}$ are studied in the framework of conformal perturbation theory. The first-order corrections for the structure…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
In this work, we construct a proximal average for two prox-bounded functions, which recovers the classical proximal average for two convex functions. The new proximal average transforms continuously in epi-topology from one proximal hull to…
In this paper we obtain several new complete characterizations of pseudolinear functions. Two of the results are of first-order and one is derivative free. All results are derived in terms of the Clarke-Rockafellar subdifferential.…
We present a precise characterization of linear functional-repair storage codes in terms of {\em admissible states/}, with each state made up from a collection of vector spaces over some fixed finite field. To illustrate the usefulness of…
A simple graph $G=(V,E)$ is a $(2,1)$-circuit if $|E|=2|V|$ and $|E(H)|\leq 2|V(H)|-1$ for every proper subgraph $H$ of $G$. Motivated, in part, by ongoing work to understand unique realisations of graphs on surfaces, we derive a…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…