English
Related papers

Related papers: A separation result for countable unions of Borel …

200 papers

In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…

Number Theory · Mathematics 2016-06-07 Mohamed El Bachraoui

Ordinal analysis induces a partition of $\Sigma^1_1$-definable and $\Pi^1_1$-sound theories whereby two theories are equivalent if they have the same proof-theoretic ordinal. We show that no equivalence relation $\equiv$ is finer than the…

Logic · Mathematics 2022-09-22 James Walsh

We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…

Classical Analysis and ODEs · Mathematics 2015-06-26 Alexei Borodin

This article provides an account of the functorial correspondence between irreducible singular $G$-monopoles on $S^1\times \Sigma$ and $\vec{t}$-stable meromorphic pairs on $\Sigma$. The main theorem of [1] is thus generalized here from…

Differential Geometry · Mathematics 2015-11-26 Benjamin H. Smith

We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…

Classical Analysis and ODEs · Mathematics 2012-11-20 Mourad E. H. Ismail , Anisse Kasraoui , Jiang Zeng

Let $X$ be a Polish space, $d$ a pseudo-metric on $X$. If $\{(u,v):d(u,v)<\delta\}$ is ${\bf\Pi}^1_1$ for each $\delta>0$, we show that either $(X,d)$ is separable or there are $\delta>0$ and a perfect set $C\subseteq X$ such that…

Logic · Mathematics 2010-06-24 Longyun Ding

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Rings and Algebras · Mathematics 2017-03-22 Jason K. C. Polak

We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\operatorname{Holant}\left(f\mid =_3 \right)$, where $f$ is any integer-valued ternary…

Computational Complexity · Computer Science 2021-10-05 Jin-Yi Cai , Austen Z. Fan , Yin Liu

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

Logic · Mathematics 2020-01-09 Samuel Coskey , Paul Ellis

In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb{Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a…

Logic · Mathematics 2025-03-26 Su Gao , Ming Xiao

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Number Theory · Mathematics 2015-10-30 Jakob Ablinger

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

alg-geom · Mathematics 2008-02-03 F. Acquistapace , C. Andradas , F. Broglia

Goedel's functional "Dialectica" interpretation can be used to extract functional programs from non-constructive proofs in arithmetic by employing two sorts of higher-order witnessing terms: positive realisers and negative counterexamples.…

Logic in Computer Science · Computer Science 2011-01-31 Trifon Trifonov

Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from a smaller class. We discuss the separation problem for regular languages. We give a Ptime algorithm to…

Formal Languages and Automata Theory · Computer Science 2013-04-26 Thomas Place , Lorijn van Rooijen , Marc Zeitoun

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Logic · Mathematics 2016-11-04 Mohammad Assem

We introduce the property of countable separation for a locally convex Hausdorff space $X$ and relate it to the existence of a metrizable coarser topology. Building on this, we demonstrate how the separability of $X$ is equivalent to the…

Functional Analysis · Mathematics 2025-10-10 Thomas Ruf

The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.

Rings and Algebras · Mathematics 2011-02-11 Béla Csákány , Tamás Waldhauser

We prove that every finite Borel measure $\mu$ in $\mathbb{R}^N$ that is bounded from above by the Hausdorff measure $\mathcal{H}^s$ can be split in countable many parts $\mu\lfloor_{E_k}$ that are bounded from above by the Hausdorff…

Classical Analysis and ODEs · Mathematics 2025-02-05 Antoine Detaille , Augusto C. Ponce

For an associative algebra $A$ with a simple module $M$ with trivial endomorphisms and trivial annihilator we verify the countable separation property (CSP), i.e. we prove that there exists a list of nonzero elements $a_1, a_2,\ldots$ of…

Rings and Algebras · Mathematics 2025-10-30 Alexey Petukhov

A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…

Symbolic Computation · Computer Science 2007-05-23 Thomas Wolf