Continua for which connected partitions are compact

We investigate connected partitions of continua into compacta. In particular, we consider continua with property that every connected partition into compacta is compact. We characterize graphs which have this property as the trees and the simple closed curve. Dendrites are shown to have the property. An example of a nonlocally connected continuum with the property is also given.     

Comparing clusterings—an information based distance

This paper proposes an information theoretic criterion for comparing two partitions, or clusterings, of the same data set. The criterion, called variation of information (VI), measures the amount of information lost and gained in changing from clustering C to clustering C^′. The basic properties of VI are presented and discussed. We focus on two kinds of properties: (1) those that help one build intuition about the new criterion (in particular, it is shown the VI is a true metric on the space of clusterings), and (2) those that pertain to the comparability of VI values over different experimental conditions. As the latter properties have rarely been discussed explicitly before, other existing comparison criteria are also examined in their light. Finally we present the VI from an axiomatic point of view, showing that it is the only “sensible” criterion for comparing partitions that is both aligned to the lattice and convexely additive. As a consequence, we prove an impossibility result for comparing partitions: there is no criterion for comparing partitions that simultaneously satisfies the above two desirable properties and is bounded.     

Multifractal Analysis of Local Entropies for Gibbs Measures

Recently in the series of papers L. Barreira, Ya.B. Pesin, J. Schmeling and H. Weiss performed a complete multifractal analysis of local dimensions, entropies and Lyapunov exponents of conformal expanding maps and surface Axion A diffeomorphisms for Gibbs measures. The main goal of these papers was primarily the analysis of the local (pointwise) dimensions. This is an extremely difficult problem and, for example, similar results for hyperbolic systems in dimensions 3 and higher have not been yet obtained. In the present work we concentrate our attention on the multifractal analysis of the local (pointwise) entropies. We are able to obtain results, which are similar to those mentioned above, for Gibbs measures of the expansive homeomorphisms with specification property. Note that such homeomorphisms may not have Markov partitions, which is a crucial condition in the previous works. However, due to the fact that less is known about thermodynamical properties of these dynamical systems we were able to obtain only the continuous differentiability of the multifractal spectrum of local entropies (compare: the same spectra for the dynamical systems with Markov partitions are analytic). We believe that the smoothness of the multifractal spectrum in our case can be improved. We have related the multifractal spectrum of the local entropies to the the spectrum of correlation entropies. These correlation entropies serve as entopy-like analogs of the Hentshel-Procaccia and Rényi spectra of generalized dimensions. This allows us to complete the duality between the multifractal analyses of local dimensions and entropies. Complete proofs can be found in [TV98] and will appear elsewhere.     

滤子的限制,性质保持与弱划分性质

本文给出划分的限制的一个基本性质，κ 连续性，证明了划分空间上的滤子的κ 完全性，精细性，超滤子性，准超滤子性，等关于限制保持．另外，本文还给出划分空     

The lattice of integer partitions and its infinite extension

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all partitions of a positive integer, equipped with a dominance ordering. We first explain how this lattice can be constructed by an algorithm in linear time with respect to its size by showing that it has a self-similar structure. Then, we define a natural extension of the model to infinity, which we compare with the Young lattice. Using a self-similar tree, we obtain an encoding of the obtained lattice which makes it possible to enumerate easily and efficiently all the partitions of a given integer. This approach also gives a recursive formula for the number of partitions of an integer, and some informations on special sets of partitions, such as length bounded partitions.     

非时齐马尔科夫链及其轨道的概率构造

给出了一种由局部刻画构造非时齐马尔科夫链的概率方法.以任意时刻之后第一次跳的时间为条件,证明了过程的马尔科夫性,同时得到了转移概率的递归表达式—这种做法使其概率意义得以明确呈现,并且进一步证明了强马尔科夫性等一系列性质.这为数值模拟,即以Monte Carlo生成非时齐Q-过程的随机轨道提供了严格的理论基础.     

Dynamical Locality and Covariance: What Makes a Physical Theory the Same in all Spacetimes?

The question of what it means for a theory to describe the same physics on all spacetimes (SPASs) is discussed. As there may be many answers to this question, we isolate a necessary condition, the SPASs property, that should be satisfied by any reasonable notion of SPASs. This requires that if two theories conform to a common notion of SPASs, with one a subtheory of the other, and are isomorphic in some particular spacetime, then they should be isomorphic in all globally hyperbolic spacetimes (of given dimension). The SPASs property is formulated in a functorial setting broad enough to describe general physical theories describing processes in spacetime, subject to very minimal assumptions. By explicit constructions, the full class of locally covariant theories is shown not to satisfy the SPASs property, establishing that there is no notion of SPASs encompassing all such theories. It is also shown that all locally covariant theories obeying the time-slice property possess two local substructures, one kinematical (obtained directly from the functorial structure) and the other dynamical (obtained from a natural form of dynamics, termed relative Cauchy evolution). The covariance properties of relative Cauchy evolution and the kinematic and dynamical substructures are analyzed in detail. Calling local covariant theories dynamically local if their kinematical and dynamical local substructures coincide, it is shown that the class of dynamically local theories fulfills the SPASs property. As an application in quantum field theory, we give a model independent proof of the impossibility of making a covariant choice of preferred state in all spacetimes, for theories obeying dynamical locality together with typical assumptions.     

Partitions of a Polytope and Mappings of a Point Set to Facets

Three theorems of this paper generalize previous results of the author on conjectures of A. Bezdek and V.V. Proizvolov. They show the existence of mappings from a given point set to the set of facets of a given polytope that satistfy some special conditions. Developing the same technique, some results on convex polytope partitions are presented, two of them dealing with partitions with prescribed measures of parts. Then we prove a corollary on the existence of a possibly nonconvex polytope with a given set of vertices, containing given points in its interior. We also consider problems of the following type: find an assignment of vectors from a given set to the parts of a given convex partition of ℝⁿ so that the shifts of the parts by their corresponding vectors either do not intersect by interior points or cover ℝⁿ     

Bivariate segment approximation and splines

The problem to determine partitions of a given rectangle which are optimal for segment approximation (e.g., by bivariate piecewise polynomials) is investigated. We give criteria for optimal partitions and develop algorithms for computing optimal partitions of certain types. It is shown that there is a surprising relationship between various types of optimal partitions. In this way, we obtain good partitions for interpolation by tensor product spline spaces. Our numerical examples show that the methods work efficiently.     

Locally Tabular $$\ne $$ Locally Finite

We show that for an arbitrary logic being locally tabular is a strictly weaker property than being locally finite. We describe our hunt for a logic that allows us to separate the two properties, revealing weaker and weaker conditions under which they must coincide, and showing how they are intertwined. We single out several classes of logics where the two notions coincide, including logics that are determined by a finite set of finite matrices, selfextensional logics, algebraizable and equivalential logics. Furthermore, we identify a closure property on models of a logic that, in the presence of local tabularity, is equivalent to local finiteness.     

The nestedness property of location problems on the line

We prove the existence of a nestedness property for a family of common convex parametric tactical serving facility location problems defined on the line. The parameter t is the length of the serving facility (closed interval). The nestedness property means that, given any two facility lengths \(t_1, t_2, 0 \le t_1<t_2\), there is an optimal solution with length \(t_1\) which lies within some optimal solution with length \(t_2\). The main idea of the proof is the representation of a serving facility as a point in \({\mathbb {R}}^2\) and the investigation of its geometrical properties. An intuitive graphical approach to the proof is given.     

A topological spline system approach to even degree polynomial splines

The existence of minimum norm properties for even degree polynomial splines, analogous to the. ones known for odd degree splines, is investigated within the framework of the theory of

topological spline systems. It is shown that such properties cannot exist for even degree splines interpolating functions halfway between the partition points. For another class of even

degree spline functions, however, which hterpolate the local integrals of given functions with respect to the partitions, the seeked minimum norm properties can be proved. This is carried out

by first investigating a generalized problem within the theory of spline systems and then deriving corresponding conclusions. As a corollary the existence of spline systems with respect to differential operators of fractional degree is obtained.     

Consensus of partitions : a constructive approach

Given a profile (family) ?? of partitions of a set of objects or items X, we try to establish a consensus partition containing a maximum number of joined or separated pairs in X that are also joined or separated in the profile. To do so, we define a score function, S _?? associated to any partition on X. Consensus partitions for ?? are those maximizing this function. Therefore, these consensus partitions have the median property for the profile and the symmetric difference distance. This optimization problem can be solved, in certain cases, by integer linear programming. We define a polynomial heuristic which can be applied to partitions on a large set of items. In cases where an optimal solution can be computed, we show that the partitions built by this algorithm are very close to the optimum which is reached in practically all the cases, except for some sets of bipartitions.     

On absolute convergence of series by a general Franklin system

The paper considers general Franklin systems generated by strong regular partitions of the segment [0; 1]. For such systems we prove the following assertions: 1) the absolute convergence of a Fourier-Franklin series at a point is a local property; 2) the Fourier-Franklin series of a function of bounded variation absolute converges almost everywhere; 3) any almost everywhere finite measurable function can be represented by an almost everywhere absolutely convergent series by a general Franklin system.     

A self-dual poset on objects counted by the Catalan numbers and a type-B analogue

We introduce two partially ordered sets, P_n^A and P_n^B, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of P_n^A and P_n^B are subsets of the symmetric and the hyperoctahedral groups, consisting of permutations which avoid certain patterns. The order relation is given by (strict) containment of the descent sets. In each case, by means of an explicit order-preserving bijection, we show that the poset of restricted permutations is an extension of the refinement order on noncrossing partitions. Several structural properties of these permutation posets follow, including self-duality and the strong Sperner property. We also discuss posets Q_n^A and Q_n^B similarly associated with noncrossing partitions, defined by means of the excedance sets of suitable pattern-avoiding subsets of the symmetric and hyperoctahedral groups.     

Local Properties of Ternary Rings of Operators and Their Linking C *-Algebras

We show that some local properties (such as nuclearity, exactness, and local reflexivity) of ternary rings of operators (TROs) are closely related to the local properties of their linking C^*-algebras. We also show some equivalent conditions for nuclear TROs, and show that Haagerup's decomposition property for completely bounded maps and Pisier's δ-norm can be naturally generalized to TROs.     

Reconstruction of a tree from its homomorphic images and other related transforms

It is shown that a tree is uniquely reconstructable from its homomorphic images. In addition, the classes of elementary contractions and elementary partitions of a tree are also shown to possess this property. In each case, only the isomorphically distinct transforms of the tree are assumed given for the reconstruction. In the case of elementary contractions the proof uses the reconstruction property of a tree from its endpoint deleted subtrees, which is well-known.     

Vanishing of cohomology over Cohen–Macaulay rings

A 2003 counterexample to a conjecture of Auslander brought attention to a family of rings—colloquially called AC rings—that satisfy a natural condition on vanishing of cohomology. Several results attest to the remarkable homological properties of AC rings, but their definition is barely operational, and it remains unknown if they form a class that is closed under typical constructions in ring theory. In this paper, we study transfer of the AC property along local homomorphisms of Cohen–Macaulay rings. In particular, we show that the AC property is preserved by standard procedures in local algebra. Our results also yield new examples of Cohen–Macaulay AC rings.     

Idempotent Block Splitting on Partial Partitions,I: Isotone Operators

Image segmentation algorithms can be modelled as image-guided operators (maps) on the complete lattice of partitions of space, or on the one of partial partitions (i.e., partitions of subsets of the space). In particular region-splitting segmentation algorithms correspond to block splitting operators on the lattice of partial partitions, in other words anti-extensive operators that act by splitting each block independently. This first paper studies in detail block splitting operators and their lattice-theoretical and monoid properties; in particular we consider their idempotence (a requirement in image segmentation). We characterize block splitting openings (kernel operators) as operators splitting each block into its connected components according to a partial connection; furthermore, block splitting openings constitute a complete sublattice of the complete lattice of all openings on partial partitions. Our results underlie the connective approach to image segmentation introduced by Serra. The second paper will study two classes of non-isotone idempotent block splitting operators, that are also relevant to image segmentation.