Beth’s theorem in cardinality logics

We prove that the Beth definability theorem fails for a comprehensive class of first-order logics with cardinality quantifiers. In particular, we give a counterexample to Beth’s theorem forL(Q), which is finitary first-order logic (with identity) augmented with the quantifier “there exists uncountably many”. This research was partially supported by NSF GP29254.     

The minimal cardinality where the Reznichenko property fails

A topological spaceX has the Fréchet-Urysohn property if for each subsetA ofX and each elementx inĀ, there exists a countable sequence of elements ofA which converges tox. Reznichenko introduced a natural generalization of this property, where the converging sequence of elements is replaced by a sequence of disjoint finite sets which eventually intersect each neighborhood ofx. In [5], Kočinac and Scheepers conjecture: The minimal cardinality of a setX of real numbers such thatC _p(X) does not have the weak Fréchet-Urysohn property is equal to b. (b is the minimal cardinality of an unbounded family in the Baire space^Nℕ.) We prove the Kočinac-Scheepers conjecture by showing that ifC _p(X) has the Reznichenko property, then a continuous image ofX cannot be a subbase for a non-feeble filter on ℕ. The author is partially supported by the Golda Meir Fund and the Edmund Landau Center for Research in Mathematical Analysis and Related Areas, sponsored by the Minerva Foundation (Germany).     

Pseudo-splines,wavelets and framelets

The first type of pseudo-splines were introduced in [I. Daubechies, B. Han, A. Ron, Z. Shen, Framelets: MRA-based constructions of wavelet frames, Appl. Comput. Harmon. Anal. 14 (1) (2003) 1–46; I. Selesnick, Smooth wavelet tight frames with zero moments, Appl. Comput. Harmon. Anal. 10 (2) (2001) 163–181] to construct tight framelets with desired approximation orders via the unitary extension principle of [A. Ron, Z. Shen, Affine systems in $L_2({\mathbb{R}}^d)$: The analysis of the analysis operator, J. Funct. Anal. 148 (2) (1997) 408–447]. In the spirit of the first type of pseudo-splines, we introduce here a new type (the second type) of pseudo-splines to construct symmetric or antisymmetric tight framelets with desired approximation orders. Pseudo-splines provide a rich family of refinable functions. B-splines are one of the special classes of pseudo-splines; orthogonal refinable functions (whose shifts form an orthonormal system given in [I. Daubechies, Orthonormal bases of compactly supported wavelets, Comm. Pure Appl. Math. 41 (1988) 909–996]) are another class of pseudo-splines; and so are the interpolatory refinable functions (which are the Lagrange interpolatory functions at $\mathbb{Z}$ and were first discussed in [S. Dubuc, Interpolation through an iterative scheme, J. Math. Anal. Appl. 114 (1986) 185–204]). The other pseudo-splines with various orders fill in the gaps between the B-splines and orthogonal refinable functions for the first type and between B-splines and interpolatory refinable functions for the second type. This gives a wide range of choices of refinable functions that meets various demands for balancing the approximation power, the length of the support, and the regularity in applications. This paper will give a regularity analysis of pseudo-splines of the both types and provide various constructions of wavelets and framelets. It is easy to see that the regularity of the first type of pseudo-splines is between B-spline and orthogonal refinable function of the same order. However, there is no precise regularity estimate for pseudo-splines in general. In this paper, an optimal estimate of the decay of the Fourier transform of the pseudo-splines is given. The regularity of pseudo-splines can then be deduced and hence, the regularity of the corresponding wavelets and framelets. The asymptotical regularity analysis, as the order of the pseudo-splines goes to infinity, is also provided. Furthermore, we show that in all tight frame systems constructed from pseudo-splines by methods provided both in [I. Daubechies, B. Han, A. Ron, Z. Shen, Framelets: MRA-based constructions of wavelet frames, Appl. Comput. Harmon. Anal. 14 (1) (2003) 1–46] and this paper, there is one tight framelet from the generating set of the tight frame system whose dilations and shifts already form a Riesz basis for $L_2(\mathbb{R})$.     

The minimal excludant and Schmidt's partition theorem

In this work, we study Schmidt's partition theorem in a combinatorial manner, and find a strong refinement which connects the minimal excludant of ordinary partitions to the length of Schmidt's partitions. As a byproduct, we obtain a bivariate form of an identity recorded in Ramanujan's lost notebook.     

Lower bounds for the cardinality of minimal blocking sets in projective spaces

In this paper new lower bounds for the cardinality of minimal m-blocking sets are determined. Let r₂(q) be the number such that q+r₂(q)+1 is the cardinality of the smallest non-trivial line-blocking set in a plane of order q. If B is a minimal m-blocking set in PG(n,q) that contains at most q^m+q^m−1+…+q+1+r₂(q)·(∑_i=2m−n′^m−1qⁱ) points for an integer n′ satisfying mn′2m, then the dimension of B is at most n′. If the dimension of B is n′, then the following holds. The cardinality of B equals q^m+q^m−1+…+q+1+r₂(q)(∑_i=2m−n′^m−1qⁱ). For n′=m the set B is an m-dimensional subspace and for n′=m+1 the set B is a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. This result is due to Heim (Mitt. Math. Semin. Giessen 226 (1996), 4–82). For n′>m+1 and q not a prime the number q is a square and for q16 the set B is a Baer cone. If q is odd and |B|<q^m+q^m−1+…+q+1+r₂(q)(q^m−1+q^m−2), it follows from this result that the subspace generated by B has dimension at most m+1. Furthermore we prove that in this case, if , then B is an m-dimensional subspace or a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. For q=p^3h, p7 and q not a square we show this assertion for |B|q^m+q^m−1+…+q+1+q^2/3·(q^m−1+…+1).     

Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs

Summary Let be given a weighted complete graph. We look for a clique of given cardinality and with minimal cost. This problem arises when selecting facilities so as to minimise their average distance. Two heuristic solution methods prove to be encouraging and are numerically compared with respect to efficiency.

---

Zusammenfassung Gegeben sei ein vollständiger, bewerteter Graph. Gesucht ist eine kostenminimale Clique mit vorgegebener Kardinalität. Dieses Problem tritt bei der Auswahl von Standorten auf, wenn deren durchschnittliche gegenseitige Entfernung zu minimieren ist. Zwei heuristische Lösungsverfahren erweisen sich als günstig und werden bezüglich ihrer Wirksamkeit numerisch verglichen.

     

多数满意陪审团定理的极大和极小概率

证明了在群体中,当各个体正确判断方案满意性的概率越分散,由多数满意规则确定的相应群体正确判断方案满意性的概率将越大.根据这一结果得到：在所有的个体正确判断方案满意性的平均概率相同的情况下,由多数满意陪审团定理决定的群体正确判断方案满意性的极大概率和极小概率的表达式.     

Existence and uniqueness theorem for uncertain differential equations

Canonical process is a Lipschitz continuous uncertain process with stationary and independent increments, and uncertain differential equation is a type of differential equations driven by canonical process. This paper presents some methods to solve linear uncertain differential equations, and proves an existence and uniqueness theorem of solution for uncertain differential equation under Lipschitz condition and linear growth condition.     

Wavelets and framelets from dual pseudo splines

Dual pseudo splines constitute a new class of refinable functions with B-splines as special examples.In this paper,we shall construct Riesz wavelet associated with dual pseudo splines.Furthermore,we use dual pseudo splines to construct tight frame systems with desired approximation order by applying the unitary extension principle.     

Band-limited refinable functions for wavelets and framelets

Extending band-limited constructions of orthonormal refinable functions, a special class of periodic functions is used to generate a family of band-limited refinable functions. Characterizations of Riesz bases and frames formed by integer shifts of these refinable functions are obtained. Such families of refinable functions are employed to construct band-limited biorthogonal wavelet bases and biframes with desirable time-frequency localization.     

Existence of codimension one foliations with minimal leaves

Every smooth closed manifold of dimension 4 or greater that has a smooth codimension one foliation, has such aC ¹ foliation whose leaves are minimal hypersurfaces for someC ¹ Riemannian metric.     

A decomposition theorem on Euclidean Steiner minimal trees

The Euclidean Steiner minimal tree problem is known to be an NP-complete problem and current alogorithms cannot solve problems with more than 30 points. Thus decomposition theorems can be very helpful in extending the boundary of workable problems. There have been only two known decomposition theorems in the literature. This paper provides a 50% increase in the reservoir of decomposition theorems.     

A sharp Bernstein-type theorem for entire minimal graphs

We consider entire solutions u to the minimal surface equation in \(\mathbb {R}^N\), with \( N\ge 8,\) and we prove the following sharp result: if \(N-7\) partial derivatives \( \frac{\partial u }{\partial {x_j}}\) are bounded on one side (not necessarily the same), then u is necessarily an affine function.