English
Related papers

Related papers: Borel sets without perfectly many overlapping tran…

200 papers

The size estimation problem in electrical impedance tomography is considered when the conductivity is a complex number and the body is two-dimensional. Upper and lower bounds on the volume fraction of the unknown inclusion embedded in the…

Analysis of PDEs · Mathematics 2013-10-10 Hyeonbae Kang , Kyoungsun Kim , Hyundae Lee , Xiaofei Li , Graeme W. Milton

For a set $X\sbst\R$, let $B(X)\sbst\R^X$ denote the space of Borel real-valued functions on $X$, with the topology inherited from the Tychonoff product $\R^X$. Assume that for each countable $A\sbst B(X)$, each $f$ in the closure of $A$ is…

General Topology · Mathematics 2012-10-19 Tal Orenshtein , Boaz Tsaban

We provide examples of nonseparable spaces $X$ for which C(X) admits an isometric shift of type I, which solves in the negative a problem proposed by Gutek {\em et al.} (J. Funct. Anal. {\bf 101} (1991), 97-119). We also give two…

Functional Analysis · Mathematics 2007-07-18 Jesus Araujo

We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show…

Logic · Mathematics 2023-06-22 Nathanael L. Ackerman , Cameron E. Freer , Robert S. Lubarsky

This paper explores the possibilities and limitations of error correction by the structural simplicity of error mechanisms. Specifically, we consider channel models, called \emph{samplable additive channels}, in which (a) errors are…

Information Theory · Computer Science 2018-05-15 Kenji Yasunaga

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…

General Mathematics · Mathematics 2012-01-26 Antonio Leon

In this paper, we add to the characterization of the Fourier spectra for Bernoulli convolution measures. These measures are supported on Cantor subsets of the line. We prove that performing an odd additive translation to half the canonical…

Spectral Theory · Mathematics 2013-10-29 Palle E. T. Jorgensen , Keri A. Kornelson , Karen L. Shuman

In 1984, K. Mahler asked how well elements in the Cantor middle third set can be approximated by rational numbers from that set, and by rational numbers outside of that set. We consider more general missing digit sets $C$ and construct…

Number Theory · Mathematics 2019-11-11 Damien Roy , Johannes Schleischitz

We show there exists a complete theory in a language of size continuum possessing a unique atomic model which is not constructible. We also show it is consistent with $ZFC + \aleph_1 < 2^{\aleph_0}$ that there is a complete theory in a…

Logic · Mathematics 2016-07-27 Douglas Ulrich

We prove that it is relatively consistent with ZFC that in any perfect Polish space, for every nonmeager set A there exists a nowhere dense Cantor set C such that A intersect C is nonmeager in C. We also examine variants of this result and…

Logic · Mathematics 2007-05-23 Maxim R. Burke , Arnold W. Miller

We provide a complete set of supersymmetric constraints for the anomalous dimensions of the conformal twist-two operators to all orders of perturbation theory. Employing them we derive new relations between the exclusive evolution kernels…

High Energy Physics - Phenomenology · Physics 2009-10-31 A. V. Belitsky , D. Müller

This paper contains new results on two classical topics in fractal geometry: projections, and intersections with affine planes. To keep the notation of the abstract simple, we restrict the discussion to the planar cases of our theorems. Our…

Classical Analysis and ODEs · Mathematics 2016-07-27 Pertti Mattila , Tuomas Orponen

In $\mathsf{ZFC}$, if there is a measurable cardinal with infinitely many Woodin cardinals below it, then for every equivalence relation $E \in L(\mathbb{R})$ on $\mathbb{R}$ with all $\mathbf{\Delta}_1^1$ classes and every $\sigma$-ideal…

Logic · Mathematics 2016-08-18 William Chan , Menachem Magidor

Extrapolations of numerical data obtained from finite cluster calculations to the infinite volume limit can often give incorrect results. We discuss four separate cases: (a) the intensity of the lowest two-photon absorption in the infinite…

Condensed Matter · Physics 2007-05-23 S. Mazumdar , F. Guo , D. Guo , K. -C. Ung , J. Tinka Gammel

We give sufficient conditions for two Cantor sets of the line to be nested for a positive set of translation parameters. This problem occurs in diophantine approximations. It also occurs as a toy model of the parameter selection for…

Dynamical Systems · Mathematics 2013-07-29 Pierre Berger , Carlos Gustavo Moreira

We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set "cancels randomness" in the sense that some of its members, when added to Martin-Lof random reals, identify a point with lower…

Computational Complexity · Computer Science 2021-02-09 Randall Dougherty , Jack Lutz , R. Daniel Mauldin , Jason Teutsch

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

Logic · Mathematics 2016-05-04 Philipp Hieronymi

Let $E, F\subset \R^d$ be two self-similar sets. Under mild conditions, we show that $F$ can be $C^1$-embedded into $E$ if and only if it can be affinely embedded into $E$; furthermore if $F$ can not be affinely embedded into $E$, then the…

Dynamical Systems · Mathematics 2014-06-23 De-Jun Feng , Wen Huang , Hui Rao

In this paper we study the descriptive complexity of the topological orbit equvalence relation for some Borel classes of Cantor minimal systems. Specifically, we study the Borel class of all Cantor minimal systems with only finitely many…

Dynamical Systems · Mathematics 2026-01-05 Su Gao , Ruiwen Li , Yiming Sun

The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have…

Logic in Computer Science · Computer Science 2020-05-14 Neng-Fa Zhou
‹ Prev 1 4 5 6 7 8 10 Next ›