English
Related papers

Related papers: Countable open and closed functions

200 papers

We prove that every bounded finely plurisubharmonic function can be locally (in the pluri-fine topology) written as the difference of two usual plurisubharmonic functions. As a consequence finely plurisubharmonic functions are continuous…

Complex Variables · Mathematics 2009-06-12 Said El Marzguioui , Jan Wiegerinck

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…

General Topology · Mathematics 2024-11-11 Anton Lipin

In this paper we prove that there are exactly eight function fields, up to isomorphism, over finite fields with class number one.

Number Theory · Mathematics 2015-03-05 Pietro Mercuri , Claudio Stirpe

We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational model of an extension of PCF supporting the…

Logic in Computer Science · Computer Science 2017-11-28 Thomas Ehrhard , Michele Pagani , Christine Tasson

Given a charge and current distribution with compact support, the associated potentials and fields are generally not integrable in the classical sense. However, it is convenient to be able to define their Fourier transform in order to…

Mathematical Physics · Physics 2024-03-15 Tristram de Piro

Given a finite and non-empty set $X$ and randomly selected specific functions and relations on $X$, we investigate the existence and non-existence of fixed points and reflexive points, respectively. First, we consider the class of…

Discrete Mathematics · Computer Science 2026-05-28 Rudolf Berghammer , Jules Desharnais , Michael Winter

Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…

Logic in Computer Science · Computer Science 2023-11-13 Dieter Spreen

Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem…

Logic in Computer Science · Computer Science 2021-02-16 Michael J. Maher

In this paper we study the property of separability of functional space with the open-point and bi-point-open topologies.

General Topology · Mathematics 2016-02-15 Alexander V. Osipov

In this paper, we define a subclass of sense-preserving harmonic functions associated with a class of analytic functions satisfying a differential inequality. We then establish a close relation between both subclasses. Further, we obtain…

Complex Variables · Mathematics 2024-06-21 Prachi Prajna Dash , Jugal Kishore Prajapat

The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…

funct-an · Mathematics 2008-02-03 Elijah Liflyand

We study the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number…

Computational Complexity · Computer Science 2007-05-23 Fredrik Kuivinen

Starting from special near-bent functions in dimension 2t-1 we construct bent functions in dimension 2t having a specific derivative. We deduce new famillies of bent functions

Information Theory · Computer Science 2014-05-23 Jacques Wolfmann

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

Computational Complexity · Computer Science 2020-10-23 Aniruddha Biswas , Palash Sarkar

Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…

Logic · Mathematics 2026-04-28 Shay Allen Logan , Blane Worley

The Chebyshev polynomials are utilized in this study to define the subclass of the bi-univalent function. Also, Chebyshev polynomial bounds and Fekete-Szego inequalities for functions defined in the classes are established.

Complex Variables · Mathematics 2022-09-20 G. M. Birajdar , N. D. Sangle

In deformation quantization one can associate five characteristic functions to (stable) formality morphisms on cochains and chains and to "two-brane" formality morphisms. We show that these characteristic functions agree.

Quantum Algebra · Mathematics 2015-02-23 Thomas Willwacher

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

Functional Analysis · Mathematics 2018-06-29 Michael Hinz , Alexander Teplyaev

The function f:X -> Y is called k-monotonically increasing if there is a partition X = X_1 U ... U X_k such that f|X_i : X_i -> Y is monotonically increasing for i=1,...,k. It is proved that a one-to-one function f:N -> N is k-monotonically…

Combinatorics · Mathematics 2007-05-23 Melvyn B. Nathanson , Rohit Parikh , Samer Salame

We define two recursive functions obtained by decomposition of a given interval into four close parts and prove two lemmas which determine features of these functions.

Discrete Mathematics · Computer Science 2013-06-11 Mark Korenblit , Vadim E. Levit
‹ Prev 1 8 9 10 Next ›