Generalized Shift-Invariant Systems

A countable collection $X$ of functions in $L_2(\mbox{\footnotesize\bf R})$ is said to be a Bessel system if the associated analysis operator $$ \txs{X}:L_2(\mbox{\smallbf R}^d)\to \ell_2(X) : f\mapsto (\inpro{f,x})_{x\in X} $$ is well-defined and bounded. A Bessel system is a fundamental frame if $\txs{X}$ is injective and its range is closed. This paper considers the above two properties for a generalized shift-invariant system $X$. By definition, such a system has the form $$ X=\bigcup_{j\in J} Y_j, $$ where each $Y_j$ is a shift-invariant system (i.e., is comprised of lattice translates of some function(s)) and $J$ is a countable (or finite) index set. The definition is general enough to include wavelet systems, shift-invariant systems, Gabor systems, and many variations of wavelet systems such as quasi-affine ones and nonstationary ones. The main theme of this paper is the fiberization of $\txs{X}$, which allows one to study the frame and Bessel properties of $X$ via the spectral properties of a collection of finite-order Hermitian nonnegative matrices.     

Spaces in Which Countable Closed Sets Have Countable Character

It is proved that in a T ₃ space countable closed sets have countable character if and only if the set of limit point of the space is a countable compact set and every compact set is of countable character. Also, it is shown that spaces where countable sets have countable character are WN-spaces and are very close to M-spaces. Finally, some questions of Dai and Lia are discussed and some questions are proposed.     

Downward closure of depth in countable Boolean algebras

We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.     

On the Decomposition of Order-Separable Posets of Countable Width into Chains

Order - A partially ordered set X has countable width if and only if every collection of pairwise incomparable elements of X is countable. It is order-separable if and only if there is a countable...     

可列集合套

[1]中给出模糊集的分解定理与表现定理，指出可利用集合套H＝{H（λ）|λ∈[0,1]}刻化模糊集。本文定义可列集合套H＝{H（a）|a∈Q}，Q是（0，1）的可列稠密子集。相应地给出新的分解定理与表现定理。指出可利用可列集合套刻化的模糊集。     

Nonprobability Gibbs measures for the HC model with a countable set of spin values for a “wand”-type graph on a Cayley tree

Theoretical and Mathematical Physics - We study Gibbs measures for the HC model with a countable set $$\mathbb Z$$ of spin values and a countable set of parameters (i.e., with the activity function...     

A countable definable set containing no definable elements

The consistency of the existence of a countable definable set of reals, containing no definable elements, is established. The model, where such a set exists, is obtained by means of a countable product of Jensen’s forcing with finite support.     

End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays

We prove that a countable connected graph has an end-faithful spanning tree that contains a prescribed set of rays whenever this set is countable, and we show that this solution is, in a certain sense, the best possible. This improves a result of Hahn and Siran [2, Theorem 1]     

A Countable Structure Does Not Have a Free Uncountable Automorphism Group

It is proved that the automorphism group of a countable structurecannot be a free uncountable group. The idea is that insteadof proving that every countable set of equations of a certainform has a solution, it is proved that this holds for a co-meagrefamily of appropriate countable sets of equations. This researchwas partially supported by the Israel Science Foundation.     

An undecidable extension of Morley's theorem on the number of countable models

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of equivalence relations obtained by countable intersections of projective sets in several models of set theory. Our methods include random and Cohen forcing, Woodin cardinals and Inner Model Theory.     

Strong convergence of a new composite iterative method for equilibrium problems and fixed point problems

In this paper, we propose a new composite iterative method for finding a common point of the set of solutions of an equilibrium problem and the set of fixed points of a countable family of nonexpansive mappings in a Hilbert space. It is proved that the sequence generated by the iterative scheme converges strongly to a common point of the set of solutions of an equilibrium problem and the set of fixed points of a countable family of nonexpansive mappings. Our results improve and extend the corresponding ones announced by many others.     

Bounded Scott Set Saturation

We examine the relationship between two different notions of a structure being Scott set saturated and identify sufficient conditions which guarantee that a structure is uniquely Scott set saturated. We also consider theories representing Scott sets; in particular, we identify a sufficient condition on a theory T so that for any given countable Scott set there exists a completion of T that is saturated with respect to the given Scott set. These results extend Scott's characterization of countable Scott sets via models and completions of Peano arithmetic.     

The γ-borel conjecture

In this paper we prove that it is consistent that every -set is countable while not every strong measure zero set is countable. We also show that it is consistent that every strong -set is countable while not every -set is countable. On the other hand we show that every strong measure zero set is countable iff every set with the Rothberger property is countable.Thanks to Boise State University for support during the time this paper was written and to Alan Dow for some helpful discussions and to Boaz Tsaban for some suggestions to improve an earlier version.     

Interpolation and Approximation by Splines on [0, ∞ )

We investigate interpolation and approximation problems by splines, which possess a countable set of knots on the positive axis. In particular, we characterize those sets of points, which admit unique Lagrange interpolation and give some sufficient and some necessary conditions for best approximations. Moreover, we show that the classical results of spline-approximation theory are not available for splines with a countable set of knots.     

Lukasiewicz语义集上的紧Hausdorff拓扑

以Ω记从全体命题之集F（S）到单位区间的全体Lukasiewicz赋值之集.本文通过一种自然的方法在Ω上引入了Fuzzy拓扑δ,证明了其为第二可数的零维良紧空间,并证明了δ在Ω上生成的截拓扑空间是第二可数的紧Hausdorff空间,从而是可度量化的空间.     

Fréchetness of inverse limits and products

Let X be a Suslin-Borel set in a compact space. It is proved that X is either σ-scattered or contains a compact perfect set. If X is first countable, the result remains valid when X is a Suslin-Borel set in a Prohorov space. It is also proved that every first countable Prohorov space is a Baire space.     

1-transitive cyclic orderings

We give a classification of all the countable 1-transitive cyclic orderings, being those on which the automorphism group acts singly transitively. We also classify all the countable 1-transitive coloured cyclic orderings, where these are countable cyclic orderings in which each point is assigned a member of a set C, thought of as its ‘colour’, and by ‘1-transitivity’ we now mean that the automorphism group acts singly transitively on each set of points coloured by a fixed colour. We conclude by giving constructions of some uncountable cyclic orderings whose automorphism groups enjoy certain special properties.     

广义框架和广义Riesz基的摄动

引入并研究了Banach空间X中的Bessel集、广义框架与广义Riesz基．对X中的任一Bessel集{gm}m∈M，定义有界线性算子T：L^2（P）→X^＊，利用算子丁，给出了Bessel集与广义框架的等价刻画．同时讨论了广义框架和广义Riesz基的摄动．     

康托尔实数的局限性

康托尔为我们建立了集合论，并且证明了实数的不可数性，但是其中留下了很多疑点． 1．—个实数能在每—个集合论模型中出现的充分必要条件是它是可以被集合论来定义的．那些在集合论模型中不出现的实数，我们可以把他们叫做看不见的实数． 2．在实数的十进位无穷小数表示法中有些是我们能确切地知道它的第几位是什么，但是对另外的一些实数我们对它们就只能有模糊的认识，也就是说它的第几位是什么我们不可能全部知道．我们可以把他们叫做写不出的实数． 3．由于Cantor关于实数是不可数的证明不是构造性的证明，而是用所谓的归谬证法．它们中有很多是看不见写不出的实数．因此说它们是虚拟的实数． 4．虚拟实数就像银行中的虚拟货币，你可用它来买东西，它可从—个户头转拨到另—个户头，但是钱的实体是不存在的。这个现象也让我们对某些数学工具的合法性挺出质疑．我们用对角线法来证明实数的基数比自然数的基数大。但是我们并没有真正有效的地构造出那么多的实数．因此我们没有办法来确切地定义它们．也可以说它们中的绝大多数是不可以定义的．在一般的情况下虚拟实数是不可以个别地使用的．     

Certain geometric properties of normalized Bessel functions

In this paper, we give a set of sufficient conditions for the normalized form of the generalized Bessel function to be univalent in the open unit disk, and further we obtain certain inequalities containing normalized Bessel functions.