English
Related papers

Related papers: On the computational properties of ambivalent sets…

200 papers

This paper continues the study of combinatorial properties of binary functions --- that is, functions $f:2^E\rightarrow\mathbb{C}$ such that $f(\emptyset)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit…

Combinatorics · Mathematics 2017-08-22 G. E. Farr

In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy…

Logic in Computer Science · Computer Science 2016-12-23 Felipe S. Abrahão

The function spaces of continuously differentiable functions are extensively studied and appear in various mathematical settings. In this context, we investigate the spaces of continuously fractional differentiable functions of order…

Functional Analysis · Mathematics 2025-04-01 Paulo M. Carvalho-Neto , Renato Fehlberg Júnior

We provide a finite basis for the class of Borel functions that are not in the first Baire class, as well as the class of Borel functions that are not $\sigma$-continuous with closed witnesses.

Logic · Mathematics 2020-02-26 Raphaël Carroy , Benjamin D. Miller

In this paper, by virtue of a determinantal formula for derivatives of the ratio between two differentiable functions, in view of the Fa\`a di Bruno formula, and with the help of several identities and closed-form formulas for the partial…

Combinatorics · Mathematics 2025-04-25 Feng Qi

We study the slicing and fine properties of functions in $\mathrm{BV}^{\mathcal A}$, the space of functions with bounded $\mathcal A$-variation. Here, $\mathcal A$ is a homogeneous linear differential operator with constant coefficients (of…

Analysis of PDEs · Mathematics 2020-10-30 Adolfo Arroyo-Rabasa

Moore introduced a class of real-valued "recursive" functions by analogy with Kleene's formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some…

Computational Complexity · Computer Science 2009-04-19 Akitoshi Kawamura

We discuss some surprising phenomena from basic calculus related to oscillating functions and to the theorem on the differentiability of inverse functions. Among other things, we see that a continuously differentiable function with a strict…

History and Overview · Mathematics 2016-09-29 Juergen Grahl , Shahar Nevo

Inspired by the recent works of Srivastava et al. (2010), Frasin and Aouf (2011), and Caglar et al. (2013), we introduce and investigate in the present paper two new general subclasses of the class consisting of normalized analytic and…

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

Basic principles of set theory have been applied in the context of probability and binary computation. Applying the same principles on inequalities is less common but can be extremely beneficial in a variety of fields. This paper formulates…

Symbolic Computation · Computer Science 2019-12-30 Jasdeep Singh Grover

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

In this paper, we shall prove, for any $m\geq 1$, the existence of an uncountable subset of $U$-numbers of type $\leq m$ (which we called the set of {\it $m$-ultra numbers}) for which there exists uncountably many transcendental analytic…

Number Theory · Mathematics 2014-09-01 Diego Marques , Josimar Ramirez

With the help of semi-neighborhoods of the diagonal, classes of Baire spaces are defined: $\Delta$, $\Delta_h$ and $\Delta_s$ Baire spaces. These classes of spaces are studied with the help of topological games. They are useful in studying…

General Topology · Mathematics 2024-10-29 Evgenii Reznichenko

Let X and Y be separable metrizable spaces, and f:X-->Y be a function. We want to recover f from its values on a small set via a simple algorithm. We show that this is possible if f is Baire class one, and in fact we get a characterization.…

Logic · Mathematics 2007-10-02 Dominique Lecomte

Let $k$ be a fixed finite geometric extension of the rational function field $\mathbb{F}_q(t)$. Let $F/k$ be a finite abelian extension such that there is an $\Fq$-rational place $\infty$ in $k$ which splits in $F/k$ and let $\mathcal{O}_F$…

Number Theory · Mathematics 2014-03-27 Ming-Deh Huang , Anand Kumar Narayanan

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

Commutative Algebra · Mathematics 2007-05-23 Winfried Bruns , Bogdan Ichim

Under certain hypotheses on the Banach space $X$, we prove that the set of analytic functions in $\mathcal{A}_u(X)$ (the algebra of all holomorphic and uniformly continuous functions in the ball of $X$) whose Aron-Berner extensions attain…

Functional Analysis · Mathematics 2015-04-07 Daniel Carando , Martin Mazzitelli

A normalized analytic function f is shown to be univalent in the open unit disk D if its second coefficient is sufficiently small and relates to its Schwarzian derivative through a certain inequality. New criteria for analytic functions to…

Complex Variables · Mathematics 2011-08-30 Rosihan M. Ali , Mahnaz M. Nargesi , V. Ravichandran , A. Swaminathan

Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…

Optimization and Control · Mathematics 2025-01-30 Reinier Diàz Millàn , Nadezda Sukhorukova , Julien Ugon

We present polygraphic programs, a subclass of Albert Burroni's polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic…

Logic in Computer Science · Computer Science 2008-10-07 Guillaume Bonfante , Yves Guiraud
‹ Prev 1 8 9 10 Next ›