English
Related papers

Related papers: Some Consistent Power Constructions

200 papers

In this paper, we will discuss three semantically distinct scope assignment strategies: traditional movement strategy, polyadic approach, and continuation-based approach. As a generalized quantifier on a set X is an element of C(X), the…

Logic · Mathematics 2016-08-02 Justyna Grudzinska , Marek Zawadowski

We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equation-al theories; we establish functional representation theorems; and we show…

Logic in Computer Science · Computer Science 2023-06-22 Klaus Keimel , Gordon D. Plotkin

We introduce continuous $R$-valuations on directed-complete posets (dcpos, for short), as a generalization of continuous valuations in domain theory, by extending values of continuous valuations from reals to so-called Abelian d-rags $R$.…

General Topology · Mathematics 2023-06-22 Jean Goubault-Larrecq , Xiaodong Jia

In functional analysis it is well known that every linear functional defined on the dual of a locally convex vector space which is continuous for the weak topology is the evaluation at a uniquely determined point of the given vector space.…

Logic in Computer Science · Computer Science 2017-01-11 Klaus Keimel

For any $E_\infty$ ring spectrum $E$, we show that there is an algebra $\mathrm{Pow}(E)$ of stable power operations that acts naturally on the underlying spectrum of any $E$-algebra. Further, we show that there are maps of rings $E \to…

Algebraic Topology · Mathematics 2020-02-07 Saul Glasman , Tyler Lawson

We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial…

Number Theory · Mathematics 2013-06-26 Anton Mellit , Masha Vlasenko

Arithmetic circuits (AC) are circuits over the real numbers with 0/1-valued input variables whose gates compute the sum or the product of their inputs. Positive AC -- that is, AC representing non-negative functions -- subsume many…

Computational Complexity · Computer Science 2021-10-26 Alexis de Colnet , Stefan Mengel

We give a commutative valuations monad Z on the category DCPO of dcpo's and Scott-continuous functions. Compared to the commutative valuations monads given in [Jia et al., 2021], our new monad Z is larger and it contains all push-forward…

Logic in Computer Science · Computer Science 2021-11-23 Xiaodong Jia , Michael Mislove , Vladimir Zamdzhiev

The theory of resurgence uniquely associates a factorially divergent formal power series with a collection of exponentially small non-perturbative corrections paired with a set of complex numbers known as Stokes constants. When the Borel…

Number Theory · Mathematics 2024-09-27 Veronica Fantini , Claudia Rella

The stochastic noise of splitting, defined initially on the (basic) algebra of finite unions of intervals of the real line, is extended to a largest class of domains. The $\sigma$-fields of this largest extension constitute the completion,…

Probability · Mathematics 2025-12-02 Matija Vidmar , Jon Warren

We study two types of series over a real alternative $^*$-algebra $A$. The first type are series of the form $\sum_{n} (x-y)^{\punto n}a_n$, where $a_n$ and $y$ belong to $A$ and $(x-y)^{\punto n}$ denotes the $n$--th power of $x-y$ w.r.t.\…

Complex Variables · Mathematics 2018-07-02 Riccardo Ghiloni , Alessandro Perotti

Let $(G,+)$ be a topological abelian group with a neutral element $e$ and let $\mu : G\longrightarrow\mathbb{C}$ be a continuous character of $G$. Let $(\mathcal{H}, \langle \cdot,\cdot \rangle)$ be a complex Hilbert space and let…

Representation Theory · Mathematics 2017-01-26 Bouikhalene Belaid , Elqorachi Elhoucien

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

Number Theory · Mathematics 2018-01-08 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

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

A notion of convolution is presented in the context of formal power series together with lifting constructions characterising algebras of such series, which usually are quantales. A number of examples underpin the universality of these…

Logic in Computer Science · Computer Science 2014-10-17 Brijesh Dongol , Ian J. Hayes , Georg Struth

Ehrhard, Pagani and Tasson proposed a model of probabilistic functional programming in a category of normed positive cones and stable measurable cone maps, which can be seen as a coordinate-free generalization of probabilistic coherence…

Logic in Computer Science · Computer Science 2023-06-22 Sergey Slavnov

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

Classical Analysis and ODEs · Mathematics 2019-12-17 Yuan Xu

The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…

Combinatorics · Mathematics 2022-09-15 Vladimir Danilov

A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…

Combinatorics · Mathematics 2025-07-17 Xinxuan Wang

We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness…

Logic in Computer Science · Computer Science 2023-06-22 Dirk Pattinson , Mina Mohammadian