English
Related papers

Related papers: Self-full ceers and the uniform join operator

200 papers

Let $\mathcal C$ be a class of Hausdorff topological semigroups which contains all zero-dimensional Hausdorff topological semigroups. A semigroup $X$ is called $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in…

Commutative Algebra · Mathematics 2022-02-08 Taras Banakh , Serhii Bardyla

The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing…

Formal Languages and Automata Theory · Computer Science 2024-02-09 Emmanuel Filiot , Sarah Winter

Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called (1) $\mathcal C$-$closed$ if $X$ is closed in every topological semigroup $Y\in\mathcal C$ containing $X$ as a discrete subsemigroup, (2) $ideally$ $\mathcal…

Group Theory · Mathematics 2023-01-09 Taras Banakh , Serhii Bardyla

We express the Segre class of a monomial scheme -- or, more generally, a scheme monomially supported on a set of divisors cutting out complete intersections -- in terms of an integral computed over an associated body in euclidean space. The…

Algebraic Geometry · Mathematics 2021-02-08 Paolo Aluffi

The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…

Logic · Mathematics 2021-06-25 Denis R. Hirschfeldt , Carl G. Jockusch, , Paul E. Schupp

Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…

Machine Learning · Computer Science 2016-11-14 Abram L. Friesen , Pedro Domingos

A uniform algebra $A$ on its Shilov boundary $X$ is {\em maximal} if $A$ is not $C(X)$ and there is no uniform algebra properly contained between $A$ and $C(X)$. It is {\em essentially pervasive} if $A$ is dense in $C(F)$ whenever $F$ is a…

Functional Analysis · Mathematics 2014-02-11 Pamela Gorkin , Anthony G. O'Farrell

This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…

Logic · Mathematics 2018-11-20 Eric P. Astor , Denis R. Hirschfeldt , Carl G. Jockusch

A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…

General Topology · Mathematics 2017-06-16 S. Garcia-Ferreira , A. H. Tomita

A topologized semilattice $X$ is called complete if each non-empty chain $C\subset X$ has $\inf C$ and $\sup C$ that belong to the closure $C$ of the chain $C$ in $X$. In this paper, we introduce various concepts of completeness of…

Rings and Algebras · Mathematics 2021-08-19 Konstantin Kazachenko , Alexander V. Osipov

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

The tensor complementarity problem is a specially structured nonlinear complementarity problem, then it has its particular and nice properties other than ones of the classical nonlinear complementarity problem. In this paper, it is proved…

Optimization and Control · Mathematics 2022-02-09 Yisheng Song , Gaohang Yu

Computational pseudorandomness studies the extent to which a random variable $\bf{Z}$ looks like the uniform distribution according to a class of tests $\cal{F}$. Computational entropy generalizes computational pseudorandomness by studying…

Computational Complexity · Computer Science 2020-11-13 Russell Impagliazzo , Sam McGuire

Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…

Functional Analysis · Mathematics 2025-01-14 Sachin Manjunath Naik , P. Sam Johnson

A denumerable cellular family of a topological space $\mathbf{X}$ is an infinitely countable collection of pairwise disjoint non-empty open sets of $ \mathbf{X}$. It is proved that the following statements are equivalent in $\mathbf{ZF}$:…

General Topology · Mathematics 2020-01-06 Kyriakos Keremedis , Eliza Wajch

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Léo Exibard , Emmanuel Filiot , Nathan Lhote , Pierre-Alain Reynier

Recently, many structured tensors are defined and their properties are discussed in the literature. In this paper, we introduce a new class of structured tensors, called exceptionally regular tensor, which is relevant to the tensor…

Optimization and Control · Mathematics 2015-08-27 Yong Wang , Zheng-Hai Huang , Xue-Li Bai

Any unital separable continuous C(X)-algebra with properly infinite fibres is properly infinite as soon as the compact Hausdorff space X has finite topolog-ical dimension. We study conditions under which this is still the case if the…

Operator Algebras · Mathematics 2015-07-10 Etienne Blanchard

Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called $absolutely$ $\mathcal C$-$closed$ if for any homomorphism $h:X\to Y$ to a topological semigroup $Y\in\mathcal C$, the image $h[X]$ is closed in $Y$. Let…

General Topology · Mathematics 2023-01-09 Taras Banakh , Serhii Bardyla

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

Machine Learning · Computer Science 2011-11-09 Marcus Hutter