Related papers: Representing Piecewise-Linear Functions by Functio…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
We distinguish two kinds of piecewise linear functions and provide an interesting representation for a piecewise linear function between two normed spaces. Based on such a representation, we study a fully piecewise linear vector…
In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…
We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
Given a positive definite binary quadratic form f, let r(n) = |{(x,y): f(x,y)=n}| denote its representation function. In this paper we study linear correlations of these functions. For example, if r_1, ..., r_k are representation functions,…
This paper studies the minimal length representation of the natural numbers. Let O be a fixed set of integer-valued functions (primarily hyperoperations). For each n, what is the shortest way of expressing n as a combinations of functions…
The work is devoted to the construction of a new type of intervals -- functional intervals. These intervals are built on the idea of expanding boundaries from numbers to functions. Functional intervals have shown themselves to be promising…
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…
We introduce notions of absolutely continuous functionals and representations on the non-commutative disk algebra $A_n$. Absolutely continuous functionals are used to help identify the type L part of the free semigroup algebra associated to…
We present new families of continuous piecewise linear (CPWL) functions in Rn having a number of affine pieces growing exponentially in $n$. We show that these functions can be seen as the high-dimensional generalization of the triangle…
We introduce a class of functionals on the space of rapidly decreasing sequences $s$, called $\mathcal{F}_s$-functionals, defined as decomposable sums of quadratic and convex terms with quadratic growth. We prove that such functionals…
This article is the first part of series of articles that aim to present the foundations for fuzzy variational calculus for functions taking values in the space of linearly correlated fuzzy numbers $\mathbb{R}_{\mathcal{F}(A)}$. Recall that…
Upper semicontinuous (usc) functions arise in the analysis of maximization problems, distributionally robust optimization, and function identification, which includes many problems of nonparametric statistics. We establish that every usc…
An artificial neural network is presented based on the idea of connections between units that are only active for a specific range of input values and zero outside that range (and so are not evaluated outside the active range). The…
Many combinatorial optimisation problems can be modelled as valued constraint satisfaction problems. In this paper, we present a polynomial-time algorithm solving the valued constraint satisfaction problem for a fixed number of variables…
This paper intends to lay the theoretical foundation for the method of functional maps, first presented in 2012 by Ovsjanikov, Ben-Chen, Solomon, Butscher and Guibas in the field of the theory and numerics of maps between shapes. We show…
We suggest a new method, called Functional Additive Regression, or FAR, for efficiently performing high-dimensional functional regression. FAR extends the usual linear regression model involving a functional predictor, $X(t)$, and a scalar…