English
Related papers

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

200 papers

We consider the numerical evaluation of a class of double integrals with respect to a pair of self-similar measures over a self-similar fractal set (the attractor of an iterated function system), with a weakly singular integrand of…

Numerical Analysis · Mathematics 2023-09-07 Andrew Gibbs , David P. Hewett , Botond Major

We show that any multiplicative bijection between the algebras of differentiable functions, defined on differentiable manifolds of positive dimension, is an algebra isomorphism, given by composition with a unique diffeomorphism.

Differential Geometry · Mathematics 2011-11-09 J. Mrcun , P. Semrl

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

Number Theory · Mathematics 2017-07-12 Randell Heyman , Igor E. Shparlinski

The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…

Functional Analysis · Mathematics 2023-08-04 Christian Günther , Bahareh Khazayel , Christiane Tammer

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

Computational Geometry · Computer Science 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec

We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…

Combinatorics · Mathematics 2018-11-27 Hyunsoo Cho , JiSun Huh , Jaebum Sohn

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…

Number Theory · Mathematics 2017-07-04 Sudhansu Sekhar Rout

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

Logic in Computer Science · Computer Science 2025-08-18 Louwe Kuijer , Tony Tan , Frank Wolter , Michael Zakharyaschev

We establish that standard arithmetic subgroups of a special orthogonal group ${\rm SO}(1,n)$ are conjugacy separable. As an application we deduce this property for unit groups of certain integer group rings. We also prove that finite…

Group Theory · Mathematics 2025-03-18 Sheila Chagas , Ángel del Río , Pavel Zalesskii

In this paper, we introduce a hierarchy dividing the set $\{\sigma \in \Pi^1_2 : \Pi^1_1$-$\mathsf{CA}_0 \vdash \sigma\}$. Then, we give some characterizations of this set using weaker variants of some principles equivalent to…

Logic · Mathematics 2024-11-25 Yudai Suzuki , Keita Yokoyama

We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…

Logic · Mathematics 2025-07-25 Andrew DeLapo , David Gonzalez

We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…

Computational Complexity · Computer Science 2021-03-10 Kaspars Balodis

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…

Logic · Mathematics 2021-02-09 Howard Becker , Randall Dougherty

A unified splitting result for Ext calculated in the category of modules over a Leibniz algebra is given for the case where coefficients are either both symmetric modules or both antisymmetric modules. This is a generalization of results of…

Algebraic Topology · Mathematics 2021-09-23 Geoffrey Powell

We prove that if $V=L$ then there is a $\Pi^1_1$ maximal orthogonal (i.e. mutually singular) set of measures on Cantor space. This provides a natural counterpoint to the well-known Theorem of Preiss and Rataj that no analytic set of…

Logic · Mathematics 2009-08-26 Vera Fischer , Asger Tornquist

We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…

Logic in Computer Science · Computer Science 2014-06-03 Tony Tan , Jan Van den Bussche , Xiaowang Zhang

We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…

Probability · Mathematics 2016-09-12 Wolfgang Löhr , Thomas Rippl

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

Symbolic Computation · Computer Science 2010-07-26 Ioannis Z. Emiris , Bernard Mourrain , Elias Tsigaridas

We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…

Algebraic Geometry · Mathematics 2015-08-11 Meirav Amram , Moshe Cohen , Hao Sun , Mina Teicher , Fei Ye , Anna Zarkh

The Solecki dichotomy in descriptive set theory and the Posner-Robinson theorem in computability theory bear a superficial resemblance to each other and can sometimes be used to prove the same results, but do not have any obvious direct…

Logic · Mathematics 2023-01-19 Patrick Lutz