A maximum principle for node voltages in finitely structured,transfinite, electrical networks

Transfinite electrical networks have unique finite-powered voltage-current regimes given in terms of branch voltages and branch currents, but they do not in general possess unique node voltages. However, if their structures are sufficiently restricted, those node voltages will exist and will satisfy a maximum principle much like that which holds for ordinary infinite electrical networks. The structure that is imposed in order to establish these results generalized the idea of local-finiteness. Other properties that do not hold in general for transfinite networks but do hold under the imposed structure are Kirchhoff's current laws for nodes of any ranks and the permissibility of connecting pure voltage sources to such nodes. This work lays the foundation for a theory of transfinite random walks, which will be the subject of a subsequent work.This work was supported by the National Science Foundation under the grants DMS-9200738 and MIP-9200748.     

Crowns,cutsets, and valuable partial orders

We consider the problem of recognizing those partial orders which admit a valuation: this is a linear-algebraic condition which arises naturally in an algebraic/geometric context. We show that a partial order has at most one valuation (which is integer-valued) and present various structural conditions which are either necessary or sufficient for a partial order to be valuable. The first main result is a reduction theorem which allows us to restrict attention to those partial orders which do not have a bounded cutset. We use this and a theorem of Kelly and Rival to prove the second main result: that every contraction of a bounded partial order is fibre-valuable if and only if the partial order is a dismantlable lattice. This result has a geometric interpretation.This research was supported by the Natural Sciences and Engineering Research Council of Canada under operating grant OGP0105392.     

Application of a Tauberian theorem to finite model theory

An extension of a Tauberian theorem of Hardy and Littlewood is proved. It is used to show that, for classes of finite models satisfying certain combinatorial and growth properties, Cesàro probabilities (limits of average probabilities over second order sentences) exist. Examples of such classes include the class of unary functions and the class of partial unary functions. It is conjectured that the result holds for the usual notion of asymptotic probability as well as Cesàro probability. Evidence in support of the conjecture is presented.     

Diametric theorems in sequence spaces

We determine in almost all Manhattan lattices configurations, which for specified diameter have maximal cardinality. Cases, in which those configurations are spheres, have been studied recently by Kleitman and Fellows.For Hamming spaces we present a partial result supplementing a result of Frankl and Füredi and we formulate a general conjecture.     

Recovery of signals from unordered partial frame coefficients

In this paper, we study the feasibility and stability of recovering signals in finite-dimensional spaces from unordered partial frame coefficients. We prove that with an almost self-located robust frame, any signal except from a Lebesgue measure zero subset can be recovered from its unordered partial frame coefficients. However, the recovery is not necessarily stable with almost self-located robust frames. We propose a new class of frames, namely self-located robust frames, that ensures stable recovery for any input signal with unordered partial frame coefficients. In particular, the recovery is exact whenever the received unordered partial frame coefficients are noise-free. We also present some characterizations and constructions for (almost) self-located robust frames. Based on these characterizations and construction algorithms, we prove that any randomly generated frame is almost surely self-located robust. Moreover, frames generated with cube roots of different prime numbers are also self-located robust.     

Tame parts of free summands in coproducts of Priestley spaces

It is well known that a sum (coproduct) of a family of Priestley spaces is a compactification of their disjoint union, and that this compactification in turn can be organized into a union of pairwise disjoint order independent closed subspaces Xu, indexed by the ultrafilters u on the index set I. The nature of those subspaces Xu indexed by the free ultrafilters u is not yet fully understood.In this article we study a certain dense subset satisfying exactly those sentences in the first-order theory of partial orders which are satisfied by almost all of the Xi's. As an application we present a complete analysis of the coproduct of an increasing family of finite chains, in a sense the first non-trivial case which is not a ?ech-Stone compactification of the disjoint union I_?Xi. In this case, all the Xu's with u free turn out to be isomorphic under the Continuum Hypothesis.     

On finding the jump number of a partial orber by substitution decomposition

Consider the linear extensions of a partial order. A jump occurs in a linear extension if two consecutive elements are unrelated in the partial order. The jump number problem is to find a linear extension of the ordered set which contains the smallest possible number of jumps. We discuss a decomposition approach for this problem from an algorithmic point of view. Based on this some new classes of partial orders are identified, for which the problem is polynomially solvable.     

ψ-序压缩算子的不动点定理

2005年,张宪在Banach空间中通过其中的锥所定义的半序引进了序压缩算子,证明了几个相应的定理．但是在一般的度量空间中,能否定义序压缩算子,能否得到类似的结论呢？本文在度量空间X中,通过X上的泛函ψ-所定义的半序,引进了ψ--序压缩算子,并且得到了相应的不动点定理．     

Necessary conditions in Phragmén–Lindelöf type estimates and decomposition of holomorphic functions

We study Phragmén–Lindelöf type estimates for subharmonic and holomorphic functions in one variable and discuss the relation between the two cases. Our main result gives for the type of results which we consider necessary and almost sufficient conditions under which these principles hold.     

First Observations on Prefab Posets’ Whitney Numbers

We introduce a natural partial order ≤ in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers’ triangular array — are then calculated and the explicit formula for them is provided. Next — in the second construction — we endow the set sums of prefabiants with such an another partial order that their Bell-like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial Newton coefficients and Fibonacci numbers onto the infinity of their relatives among whom there are also the Fibonacci triad sequences and binomial-like coefficients (incidence coefficients included). The first partial order is F-sequence independent while the second partial order is F-sequence dependent where F is the so-called admissible sequence determining cobweb poset by construction. An F-determined cobweb poset’s Hasse diagram becomes Fibonacci tree sheathed with specific cobweb if the sequence F is chosen to be just the Fibonacci sequence. From the stand-point of linear algebra of formal series these are generating functions which stay for the so-called extended coherent states of quantum physics. This information is delivered in the last section. Presentation (November 2006) at the Gian-Carlo Rota Polish Seminar .     

The classical decision problem and partial functions

We consider the decision problem for sets of sentences of first-order logic when instead of interpreting function symbols as total functions over the universe of a model (henceforth referred to as the usual interpretation) we interpret them as partial functions.We consider only standard classes, which are certain sets of prenex sentences specified by restrictions on the prefix and on the numbers ofk-place predicate and function symbols for eachk1. Standard classes are introduced in [1] and it is proved there that the decision problem for any set of prenex sentences specified by such restrictions reduces to that for the standard classes.We solve the decision problem completely for standard classes with at least one function symbol and both with and without equality.This problem was suggested to me by my supervisor, Professor Yuri Gurevich who was confident that the results would be very similar to those for the usual interpretation and could be achieved by similar techniques.     

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

Integrated mean square properties of density estimation by orthogonal series methods for dependent variables

Summary The rates at which integrated mean square and mean squre errors of nonparametric density estimation by orthogonal series method for sequences of strictly stationary strong mixing random variables are obtained. These rates are better than those known to hold for the independent case and they are shown to hold for Markov processes. In fact our results when specialized to the independent case are improvements over previously known results of Schwartz (1967,Ann. Math. Statist.,38, 1262–1265). An extension of the results to estimation of the bivariate density is also given. Research supported by a faculty summer research grant MS-STAT-42 from the University of Petroleum and Minerals.     

On Representing Concepts in Finite Models

We present a method of transferring Tarski's technique of classifying finite order concepts by means of truth‐definitions into finite mode theory. The other considered question is the problem of representability relations on words or natural numbers in finite models. We prove that relations representable in finite models are exactly those which are of degree ≤ o′. Finally, we consider theories of sufficiently large finite models. For a given theory T we define sl(T) as the set of all sentences true in almost all finite models for T. For theories of sufficiently large models our version of Tarski's technique becomes practically the same as the classica one. We investigate also degrees of undecidability for theories of sufficiently large finite models. We prove for some special theory ST that its degree is stronger than 0′ but still not more than Σ⁰₂.     

Pseudo‐c‐archimedean and pseudo‐finite cyclically ordered groups

Robinson and Zakon gave necessary and sufficient conditions for an abelian ordered group to satisfy the same first‐order sentences as an archimedean abelian ordered group (i.e., which embeds in the group of real numbers). The present paper generalizes their work to obtain similar results for infinite subgroups of the group of unimodular complex numbers. Furthermore, the groups which satisfy the same first‐order sentences as ultraproducts of finite cyclic groups are characterized.     

Wavelets, generalized white noise and fractional integration: The synthesis of fractional Brownian motion

We provide an almost sure convergent expansion of fractional Brownian motion in wavelets which decorrelates the high frequencies. Our approach generalizes Lévy's midpoint displacement technique which is used to generate Brownian motion. The low-frequency terms in the expansion involve an independent fractional Brownian motion evaluated at discrete times or, alternatively, partial sums of a stationary fractional ARIMA time series. The wavelets fill in the gaps and provide the necessary high frequency corrections. We also obtain a way of constructing an arbitrary number of non-Gaussian continuous time processes whose second order properties are the same as those of fractional Brownian motion.     

Weighted pseudo almost periodic functions and applications

This Note introduces a new class of functions called weighted pseudo almost periodic functions, which generalize in a natural fashion the classical pseudo almost periodic functions due to C. Zhang. Properties of those weighted pseudo almost periodic functions are discussed including a composition result of weighted pseudo almost periodic functions, which plays a crucial role for the solvability of some weighted pseudo almost periodic semilinear differential and partial differential equations. To cite this article: T. Diagana, C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

Levitan/Bohr almost periodic and almost automorphic solutions of second order monotone differential equations

The aim of this paper is to prove the existence of Levitan/Bohr almost periodic, almost automorphic, recurrent and Poisson stable solutions of the second order differential equation

(1)     

Infinite generalized friendship graphs

We give necessary and sufficient conditions for the existence of infinite generalized friendship graphs and show that there are 2° non-isomorphic ones of each admissible order c and chromatic number. Further we prove that such graphs and their complements are almost always regular of degree equal to the order and that various generalizations of the Friendship Theorem do not hold for infinite generalized friendship graphs.     

A zero-one law for a random subset

We consider first order sentences about two logical structures. First we consider 1,…, n with the successor relation and a random unary relation that points satisfy with probability p(n). We then replace the successor relation with less than. For both structures we characterize those p(n) for which a zero-one law holds.