English
Related papers

Related papers: Finite Bases with Respect to the Superposition in …

200 papers

We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…

Functional Analysis · Mathematics 2012-08-28 Faton M. Berisha

Let H be a product of countably infinite number of copies of an uncountable Polish space X. Let $\Sigma_\xi$ $(\bar {\Sigma}_\xi)$ be the class of Borel sets of additive class \xi for the product of copies of the discrete topology on X (the…

Logic · Mathematics 2007-07-16 Rana Barua , Ashok Maitra

This note is purely expository. We show how in the course of the Kolmogorov-Arnold solution of Hilbert's 13-th problem on superpositions there appeared the notion of a basic embedding. A subset K of R^2 is {\it basic} if for each continuous…

Functional Analysis · Mathematics 2010-08-20 A. Skopenkov

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

Combinatorics · Mathematics 2025-10-30 Christof Beierle , Tim Beyne

Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…

Rings and Algebras · Mathematics 2026-02-05 Stefano Fioravanti , Michael Kompatscher , Bernardo Rossi

In this work, a functional variant of the polynomial analogue of the classical Gandy's fixed point theorem is obtained. Sufficient conditions have been found to ensure that the complexity of the recursive function does not go beyond the…

Logic in Computer Science · Computer Science 2024-07-04 Andrey Nechesov

Skolem (1956) studied the germs at infinity of the smallest class of real valued functions on the positive real line containing the constant $1$, the identity function $x$, and such that whenever $f$ and $g$ are in the set, $f+g,fg$ and…

Logic · Mathematics 2020-03-30 Alessandro Berarducci , Marcello Mamino

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

Rings and Algebras · Mathematics 2014-06-10 Jean-Luc Marichal , Bruno Teheux

This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…

Optimization and Control · Mathematics 2016-04-12 Hsiao-Han Chao , Lieven Vandenberghe

Under the assumption of the existence of Stahl's $S$-compact set we give a short proof of the limit zeros distribution of Pad\'e polynomials and convergence in capacity of diagonal Pad\'e approximants for a generic class of algebraic…

Complex Variables · Mathematics 2021-08-03 Sergey P. Suetin

Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…

Combinatorics · Mathematics 2021-06-24 Paul Ressel

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…

Discrete Mathematics · Computer Science 2020-07-01 Rishabh Iyer , Jeff Bilmes

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Data Structures and Algorithms · Computer Science 2013-04-19 Nikhil R. Devanur , Shaddin Dughmi , Roy Schwartz , Ankit Sharma , Mohit Singh

Submodular and fractionally subadditive (or equivalently XOS) functions play a fundamental role in combinatorial optimization, algorithmic game theory and machine learning. Motivated by learnability of these classes of functions from random…

Data Structures and Algorithms · Computer Science 2015-08-04 Vitaly Feldman , Jan Vondrak

We consider the structure ${\mathbb R}^{\mathrm{RE}}$ obtained from $({\mathbb R},<,+,\cdot)$ by adjoining the restricted exponential and sine functions. We prove Wilkie's conjecture for sets definable in this structure: the number of…

Logic · Mathematics 2016-05-17 Gal Binyamini , Dmitry Novikov

Skolem functions play a central role in the study of first order logic, both from theoretical and practical perspectives. While every Skolemized formula in first-order logic makes use of Skolem constants and/or functions, not all such…

Logic in Computer Science · Computer Science 2022-08-05 S. Akshay , Supratik Chakraborty

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

We introduce a notion of the Bergman-Shilov (or Shilov) boundary for some subclasses of upper-semicontinuous functions on a compact Hausdorff space. It is by definition the smallest closed subset of the given space on which all functions of…

Complex Variables · Mathematics 2025-10-10 Thomas Pawlaschyk

Our objective in this paper is to introduce and investigate a newly-constructed subclass of normalized analytic and bi-univalent functions by means of the Chebyshev polynomials of the second kind. Upper bounds for the second and third…

Complex Variables · Mathematics 2021-02-18 Feras Yousef , Somaia Alroud , Mohamed Illafe

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…

Symbolic Computation · Computer Science 2015-04-08 Graham H. Norton