On Intersections of Small Perfect Sets

2002 ◽  
Vol 9 (3) ◽  
pp. 495-505
Author(s):  
H. Fast
Keyword(s):  
Unit Circle ◽  
Measure Zero ◽  
Perfect Set ◽  
Perfect Subset

Abstract For a not empty perfect subset of the unit circle C there is a perfect subset of C measure zero which being rotated to every position intersects the first set on a nonempty perfect set. This result may be stated in terms of set of distances between pairs of points from these two sets. A generalization of this result to a product of tori is suggested.

scholarly journals An application of a theorem of Singer

1974 ◽  
Vol 19 (2) ◽  
pp. 119-123 ◽  
Author(s):  
D. M. Connolly ◽  
J. H. Williamson
Keyword(s):  
Measure Zero ◽  
General Context ◽  
Measure Algebra ◽  
Absolutely Continuous ◽  
Borel Measures ◽  
Perfect Set ◽  
Convolution Power ◽  
Recent Theorem ◽  
Vector Sum ◽  
Positive Results

The authors have recently treated (2) the problem of finding subsets E of the real line , of type Fσ, such that E–E contains an interval and the k-fold vector sum (k)E is of measure zero. Positive results can be obtained, for all k, on the basis of a recent theorem of J. A. Haight (3), following earlier partial results (1), (4) for k ≦ 7; and indeed in these cases the problem has a solution with E a perfect set. An analogous problem, apparently in most respects subtler than the first, is the following. Do there exist finite regular Borel measures μ on such that is absolutely continuous (where is the adjoint of μ) and the kth convolution power μk is singular? Both problems are of interest in the general context of elucidating the properties of the measure algebra or, more generally, M(G) for locally compact abelian G. The second problem may be regarded as an attempt to provide (at least one aspect of) a multiplicity theory for the first.

scholarly journals Small sets containing any pattern

2018 ◽  
Vol 168 (1) ◽  
pp. 57-73
Author(s):  
URSULA MOLTER ◽  
ALEXIA YAVICOLI
Keyword(s):  
Hausdorff Measure ◽  
Analogous Result ◽  
Measure Zero ◽  
General Construction ◽  
Dimension Function ◽  
Perfect Set ◽  
Finite Set ◽  
Isolated Points ◽  
Special Case

AbstractGiven any dimension function h, we construct a perfect set E ⊆ ${\mathbb{R}}$ of zero h-Hausdorff measure, that contains any finite polynomial pattern.This is achieved as a special case of a more general construction in which we have a family of functions $\mathcal{F}$ that satisfy certain conditions and we construct a perfect set E in ${\mathbb{R}}^N$, of h-Hausdorff measure zero, such that for any finite set {f1,. . .,fn} ⊆ $\mathcal{F}$, E satisfies that $\bigcap_{i=1}^n f^{-1}_i(E)\neq\emptyset$.We also obtain an analogous result for the images of functions. Additionally we prove some related results for countable (not necessarily finite) intersections, obtaining, instead of a perfect set, an $\mathcal{F}_{\sigma}$ set without isolated points.

scholarly journals The perfect set theorem and definable wellorderings of the continuum

1978 ◽  
Vol 43 (4) ◽  
pp. 630-634 ◽  
Author(s):  
Alexander S. Kechris
Keyword(s):  
Elementary Proof ◽  
Regularity Conditions ◽  
Perfect Set ◽  
Perfect Subset ◽  
The Continuum

AbstractLet Γ be a collection of relations on the reals and let M be a set of reals. We call M a perfect set basis for Γ if every set in Γ with parameters from M which is not totally included in M contains a perfect subset with code in M. A simple elementary proof is given of the following result (assuming mild regularity conditions on Γ and M): If M is a perfect set basis for Γ, the field of every wellordering in Γ is contained in M. An immediate corollary is Mansfield's Theorem that the existence of a Σ21 wellordering of the reals implies that every real is constructible. Other applications and extensions of the main result are also given.

The Restricted Arc-Width of a Graph

10.37236/1734 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
David Arthur
Keyword(s):  
Unit Circle ◽  
Single Point ◽  
Minimum Width ◽  
Graph Operations ◽  
Function Mapping

An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs passing through a single point. The arc-width of a graph is defined to be the minimum width over all of its arc-representations. We extend the work of Barát and Hajnal on this subject and develop a generalization we call restricted arc-width. Our main results revolve around using this to bound arc-width from below and to examine the effect of several graph operations on arc-width. In particular, we completely describe the effect of disjoint unions and wedge sums while providing tight bounds on the effect of cones.

A COMBINATORIAL CORE OF THE ITERATED PERFECT SET MODEL

1999 ◽  
Vol 25 (1) ◽  
pp. 137
Author(s):  
Ciesielski
Keyword(s):  
Perfect Set

scholarly journals Dimension of the Exceptional Set in the Aronszajn–Donoghue Theorem for Finite Rank Perturbations

2020 ◽  
Author(s):  
Constanze Liaw ◽  
Sergei Treil ◽  
Alexander Volberg
Keyword(s):  
Finite Rank ◽  
Measure Zero ◽  
Adjoint Operator ◽  
Cyclic Vector ◽  
Spectral Measures ◽  
Hermitian Matrices ◽  
Exceptional Set ◽  
Direct Sum ◽  
Rank One Perturbation ◽  
Rank One

Abstract The classical Aronszajn–Donoghue theorem states that for a rank-one perturbation of a self-adjoint operator (by a cyclic vector) the singular parts of the spectral measures of the original and perturbed operators are mutually singular. As simple direct sum type examples show, this result does not hold for finite rank perturbations. However, the set of exceptional perturbations is pretty small. Namely, for a family of rank $d$ perturbations $A_{\boldsymbol{\alpha }}:= A + {\textbf{B}} {\boldsymbol{\alpha }} {\textbf{B}}^*$, ${\textbf{B}}:{\mathbb C}^d\to{{\mathcal{H}}}$, with ${\operatorname{Ran}}{\textbf{B}}$ being cyclic for $A$, parametrized by $d\times d$ Hermitian matrices ${\boldsymbol{\alpha }}$, the singular parts of the spectral measures of $A$ and $A_{\boldsymbol{\alpha }}$ are mutually singular for all ${\boldsymbol{\alpha }}$ except for a small exceptional set $E$. It was shown earlier by the 1st two authors, see [4], that $E$ is a subset of measure zero of the space $\textbf{H}(d)$ of $d\times d$ Hermitian matrices. In this paper, we show that the set $E$ has small Hausdorff dimension, $\dim E \le \dim \textbf{H}(d)-1 = d^2-1$.

scholarly journals A Discontinuity of the Energy of Quantum Walk in Impurities

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1134
Author(s):  
Kenta Higuchi ◽  
Takashi Komatsu ◽  
Norio Konno ◽  
Hisashi Morioka ◽  
Etsuo Segawa
Keyword(s):  
Unit Circle ◽  
Stationary State ◽  
Discrete Time ◽  
Quantum Walk ◽  
Time Limit ◽  
The Other ◽  
Unitary Matrix ◽  
Initial State ◽  
Time Quantum ◽  
Long Time

We consider the discrete-time quantum walk whose local dynamics is denoted by a common unitary matrix C at the perturbed region {0,1,⋯,M−1} and free at the other positions. We obtain the stationary state with a bounded initial state. The initial state is set so that the perturbed region receives the inflow ωn at time n(|ω|=1). From this expression, we compute the scattering on the surface of −1 and M and also compute the quantity how quantum walker accumulates in the perturbed region; namely, the energy of the quantum walk, in the long time limit. The frequency of the initial state of the influence to the energy is symmetric on the unit circle in the complex plain. We find a discontinuity of the energy with respect to the frequency of the inflow.

scholarly journals Testing Stability of Digital Filters Using Optimization Methods with Phase Analysis

Energies ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 1488
Author(s):  
Damian Trofimowicz ◽  
Tomasz P. Stefański
Keyword(s):  
Unit Circle ◽  
Phase Analysis ◽  
Characteristic Equation ◽  
Digital Filter ◽  
Digital Filters ◽  
Computing Time ◽  
Complex Function ◽  
Stochastic Methods ◽  
Final Population ◽  
Candidate Regions

In this paper, novel methods for the evaluation of digital-filter stability are investigated. The methods are based on phase analysis of a complex function in the characteristic equation of a digital filter. It allows for evaluating stability when a characteristic equation is not based on a polynomial. The operation of these methods relies on sampling the unit circle on the complex plane and extracting the phase quadrant of a function value for each sample. By calculating function-phase quadrants, regions in the immediate vicinity of unstable roots (i.e., zeros), called candidate regions, are determined. In these regions, both real and imaginary parts of complex-function values change signs. Then, the candidate regions are explored. When the sizes of the candidate regions are reduced below an assumed accuracy, then filter instability is verified with the use of discrete Cauchy’s argument principle. Three different algorithms of the unit-circle sampling are benchmarked, i.e., global complex roots and poles finding (GRPF) algorithm, multimodal genetic algorithm with phase analysis (MGA-WPA), and multimodal particle swarm optimization with phase analysis (MPSO-WPA). The algorithms are compared in four benchmarks for integer- and fractional-order digital filters and systems. Each algorithm demonstrates slightly different properties. GRPF is very fast and efficient; however, it requires an initial number of nodes large enough to detect all the roots. MPSO-WPA prevents missing roots due to the usage of stochastic space exploration by subsequent swarms. MGA-WPA converges very effectively by generating a small number of individuals and by limiting the final population size. The conducted research leads to the conclusion that stochastic methods such as MGA-WPA and MPSO-WPA are more likely to detect system instability, especially when they are run multiple times. If the computing time is not vitally important for a user, MPSO-WPA is the right choice, because it significantly prevents missing roots.

Sign in / Sign up

Export Citation Format

Share Document