English
Related papers

Related papers: Representing Piecewise-Linear Functions by Functio…

200 papers

In this paper we consider Iterated Function Systems (IFS) on the real line consisting of continuous piecewise linear functions. We assume some bounds on the contraction ratios of the functions, but we do not assume any separation condition.…

Dynamical Systems · Mathematics 2021-09-10 R. D. Prokaj , K. Simon

We give a technical overview of our exact-real implementation of various representations of the space of continuous unary real functions over the unit domain and a family of associated (partial) operations, including integration, range…

Logic in Computer Science · Computer Science 2019-10-14 Michal Konečný , Eike Neumann

We consider iterated function systems on the real line that consist of continuous, piecewise linear functions. Under a mild separation condition, we show that the Hausdorff and box dimensions of the attractor are equal to the minimum of 1…

Dynamical Systems · Mathematics 2023-02-10 R. D. Prokaj , P. Raith , K. Simon

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some linear methods of this approximation for univariate functions in the class induced by the convolution…

Numerical Analysis · Mathematics 2021-11-05 Dinh Dũng , Vu Nhat Huy

We study extremal properties of the function $$ F(x) := \min\{k\|x\|^{1-1/k}\colon k\ge 1\},\ x\in[0,1], $$ where $\|x\|=\min\{x,1-x\}$. In particular, we show that $F$ is the pointwise largest function of the class of all real-valued…

Functional Analysis · Mathematics 2013-11-26 Vsevolod F. lev

The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…

Combinatorics · Mathematics 2025-03-17 Leo Zanotti

For a real number $x$, call $\frac1n \lfloor nx \rfloor$ the $n$-th lower rational approximation of $x$. We study the functions defined by taking the cumulative average of the first $n$ lower rational approximations of $x$, which we call…

Number Theory · Mathematics 2024-02-05 David Harry Richman

This paper demonstrates that the space of piecewise smooth functions can be well approximated by the space of functions defined by a set of simple (non-linear) operations on smooth uniform splines. The examples include bivariate functions…

Numerical Analysis · Mathematics 2024-05-13 David Levin

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

Group Theory · Mathematics 2021-12-06 Robert Lin

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

General Mathematics · Mathematics 2020-10-21 Yu-Lin Chou

Relu Fully Connected Networks are ubiquitous but uninterpretable because they fit piecewise linear functions emerging from multi-layered structures and complex interactions of model weights. This paper takes a novel approach to piecewise…

Machine Learning · Computer Science 2021-11-23 Jasdeep Singh Grover , Harsh Minesh Domadia , Raj Anant Tapase , Grishma Sharma

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás

A standard theorem in nonsmooth analysis states that a piecewise affine function $F:\mathbb R^n\rightarrow\mathbb R^n$ is surjective if it is coherently oriented in that the linear parts of its selection functions all have the same nonzero…

Optimization and Control · Mathematics 2018-01-23 Manuel Radons

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

Complex Variables · Mathematics 2015-05-06 Jorge L. deLyra

This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…

Logic in Computer Science · Computer Science 2022-11-09 Zachary Kincaid , Nicolas Koh , Shaowei Zhu

Given a function dictionary $\cal D$ and an approximation budget $N\in\mathbb{N}^+$, nonlinear approximation seeks the linear combination of the best $N$ terms $\{T_n\}_{1\le n\le N}\subseteq{\cal D}$ to approximate a given function $f$…

Machine Learning · Computer Science 2020-11-06 Zuowei Shen , Haizhao Yang , Shijun Zhang

We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…

Computational Complexity · Computer Science 2018-02-27 R. Ryan Williams

Let $f:\mathbb{Q}\to \mathbb{Q}$ be a function definable in an o-minimal expansion of $(\mathbb{Q},<,+,0)$. We show that $f$ is eventually linear. In addition, we show that this holds in every elementary equivalent structure.

Logic · Mathematics 2017-05-09 Pablo Cubides Kovacsics , Françoise Delon

In a number of papers, Y. Sternfeld investigated the problems of representation of continuous and bounded functions by linear superpositions. In particular, he proved that if such representation holds for continuous functions, then it holds…

Functional Analysis · Mathematics 2015-01-22 Vugar Ismailov

One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…

Computational Complexity · Computer Science 2010-03-08 Deepak Ponvel Chermakani