Isomorphisms,definable relations,and Scott families for integral domains and commutative semigroups

In the present article, we prove the following four assertions: (1) For every computable successor ordinal α, there exists a Δ _α ⁰ -categorical integral domain (commutative semigroup) which is not relatively Δ _α ⁰ -categorical (i.e., no formally Σ _α ⁰ Scott family exists for such a structure). (2) For every computable successor ordinal α, there exists an intrinsically Σ _α ⁰ -relation on the universe of a computable integral domain (commutative semigroup) which is not a relatively intrinsically Σ _α ⁰ -relation. (3) For every computable successor ordinal α and finite n, there exists an integral domain (commutative semigroup) whose Δ _α ⁰ -dimension is equal to n. (4) For every computable successor ordinal α, there exists an integral domain (commutative semigroup) with presentations only in the degrees of sets X such that Δ _α ⁰ (X) is not Δ _α ⁰ . In particular, for every finite n, there exists an integral domain (commutative semigroup) with presentations only in the degrees that are not n-low.     

Estimation of the algorithmic complexity of classes of computable models

We estimate the algorithmic complexity of the index set of some natural classes of computable models: finite computable models (Σ ₂ ⁰ -complete), computable models with ω-categorical theories (Δ _ω ⁰ -complex Π _ω+2 ⁰ -set), prime models (Δ _ω ⁰ -complex Π _ω+2 ⁰ -set), models with ω ₁-categorical theories (Δ _ω ⁰ -complex Σ _ω+1 ⁰ -set. We obtain a universal lower bound for the model-theoretic properties preserved by Marker’s extensions (Δ _ω ⁰ .     

A theorem on strongly <Emphasis Type="Italic">η</Emphasis>-representable sets

In this paper we consider strongly η-representable sets. We prove that the union of Σ ₂ ⁰ and Π ₂ ⁰ -sets is strongly η-representable.     

Definability in Substructure Orderings,II: Finite Ordered Sets

Let \({{\uppercase {\mathcal{p}}}} \) be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We prove among other things that for every finite poset P, the set \(\{p,p^{\partial}\}\) is definable, where p and \(p^{\partial}\) are the isomorphism types of P and its dual poset. We prove that the only non-identity automorphism of \({{\uppercase {\mathcal{p}}}}\) is the duality map. Then we apply these results to investigate definability in the closely related lattice of universal classes of posets. We prove that this lattice has only one non-identity automorphism, the duality map; that the set of finitely generated and also the set of finitely axiomatizable universal classes are definable subsets of the lattice; and that for each member K of either of these two definable subsets, \(\{K,K^{\partial}\}\) is a definable subset of the lattice. Next, making fuller use of the techniques developed to establish these results, we go on to show that every isomorphism-invariant relation between finite posets that is definable in a certain strongly enriched second-order language \(\textup{\emph L}_2\) is, after factoring by isomorphism, first-order definable up to duality in the ordered set \({{\uppercase {\mathcal{p}}}}\). The language \(\textup{\emph L}_2\) has different types of quantifiable variables that range, respectively, over finite posets, their elements and order-relation, and over arbitrary subsets of posets, functions between two posets, subsets of products of finitely many posets (heteregenous relations), and can make reference to order relations between elements, the application of a function to an element, and the membership of a tuple of elements in a relation.     

An additive cohomological equation and typical behavior of Birkhoff sums over a translation of the multidimensional torus

For a periodic function f with a given decrease of the moduli of its Fourier coefficients, we analyze the solvability of the equation \(w(T_\alpha x) - w(x) = f(x) - \smallint _{\mathbb{T}^d } f(t) dt\) and the asymptotic behavior of the Birkhoff sums Σ _s=0 ^n?1 f(T _α ^s x) for almost every α. The results obtained are applied to the study of ergodic properties of a cylindrical cascade and of a special flow on the torus.     

Renormalized coupling constants for the three-dimensional scalar <Emphasis Type="Italic">λ</Emphasis><Emphasis Type="Italic">ϕ</Emphasis><Superscript>4</Superscript> field theory and pseudo-<Emphasis Type="Italic">ε</Emphasis>-expansion

The renormalized coupling constants g _2k that enter the equation of state and determine nonlinear susceptibilities of the system have universal values g _2k ^* at the Curie point. We use the pseudo-ε-expansion approach to calculate them together with the ratios R _2k = g _2k /g ₄ ^k-1 for the three-dimensional scalar λ ? ⁴ field theory. We derive pseudo-ε-expansions for g ₆ ^* , g ₈ ^* , R ₆ ^* , and R ₈ ^* in the five-loop approximation and present numerical estimates for R ₆ ^* and R ₈ ^* . The higher-order coefficients of the pseudo-ε-expansions for g ₆ ^* and R ₆ ^* are so small that simple Padé approximants turn out to suffice for very good numerical results. Using them gives R ₆ ^* = 1.650, while the recent lattice calculation gave R ₆ ^* = 1.649(2). The pseudo-ε-expansions of g ₈ ^* and R ₈ ^* are less favorable from the numerical standpoint. Nevertheless, Padé–Borel summation of the series for R ₈ ^* gives the estimate R ₈ ^* = 0.890, differing only slightly from the values R ₈ ^* = 0.871 and R ₈ ^* = 0.857 extracted from the results of lattice and field theory calculations.     

Local structure of Rogers semilattices of Σ<Subscript>n</Subscript><Superscript>0</Superscript>-computable numberings

We deal in specific features of the algebraic structure of Rogers semilattices of _n ⁰-computable numberings, for n 2. It is proved that any Lachlan semilattice is embeddable (as an ideal) in such every semilattice, and that over an arbitrary non 0-principal element of such a lattice, any Lachlan semilattice is embeddable (as an interval) in it.Supported by INTAS grant No. 00-499, by FP Universities of Russia grant UR.04.01.013, and by the Grant Center for Fundamental Research (GCFR), project PD02-1.1-475.__________Translated from Algebra i Logika, Vol. 44, No. 2, pp. 148–172, March–April, 2005.     

Continuity of posets via Scott topology and sobrification

In this paper, posets which may not be dcpos are considered. The concept of embedded bases for posets is introduced. Characterizations of continuity of posets in terms of embedded bases and Scott topology are given. The main results are:

(1)

A poset is continuous iff it is an embedded basis for a dcpo up to an isomorphism;

(2)

A poset is continuous iff its Scott topology is completely distributive;

(3)

A topological T₀ space is a continuous poset equipped with the Scott topology in the specialization order iff its topology is completely distributive and coarser than or equal to the Scott topology;

(4)

A topological T₁ space is a discrete space iff its topology is completely distributive.

These results generalize the relevant results obtained by J.D. Lawson for dcpos.     

Ideals of Priestley powers of semilattices

Let X be a poset and Y an ordered space; X ^Y denotes the poset of continuous order-preserving maps from Y to X with the discrete (respectively, Scott, Lawson) topology. If S is a -semilattice, its ideal semilattice, and T a bounded distributive lattice with Priestley dual space P(T), it is shown that the following isomorphisms hold: Moreover, and sufficient conditions and necessary conditions for the isomorphism to hold are obtained (both necessary and sufficient if S is a distributive -semilattice). Received September 27, 1995; accepted in final form April 6, 1998.     

A classification of the face numbers of Buchsbaum simplicial posets

The family of Buchsbaum simplicial posets generalizes the family of simplicial cell manifolds. The \(h'\) -vector of a simplicial complex or simplicial poset encodes the combinatorial and topological data of its face numbers and the reduced Betti numbers of its geometric realization. Novik and Swartz showed that the \(h'\) -vector of a Buchsbaum simplicial poset satisfies certain simple inequalities; in this paper we show that these necessary conditions are in fact sufficient to characterize the \(h'\) -vectors of Buchsbaum simplicial posets with prescribed Betti numbers.     

Exact distribution of MLE of covariance matrix in a GMANOVA-MANOVA model

For a GMANOVA-MANOVA model with normal error: Y = XB1Z1 T B2Z2 T E, E- Nq×n(0, In (?) ∑), the present paper is devoted to the study of distribution of MLE, ∑, of covariance matrix ∑. The main results obtained are stated as follows: (1) When rk(Z) -rk(Z2) ≥ q-rk(X), the exact distribution of ∑ is derived, where z = (Z1,Z2), rk(A) denotes the rank of matrix A. (2) The exact distribution of |∑| is gained. (3) It is proved that ntr{[S-1 - ∑-1XM(MTXT∑-1XM)-1MTXT∑-1]∑}has X2(q_rk(x))(n-rk(z2)) distribution, where M is the matrix whose columns are the standardized orthogonal eigenvectors corresponding to the nonzero eigenvalues of XT∑-1X.     

Conditioning of finite difference schemes for a singularly perturbed convection-diffusion parabolic equation

In the case of the boundary value problem for a singularly perturbed convection-diffusion parabolic equation, conditioning of an ε-uniformly convergent finite difference scheme on a piecewise uniform grid is examined. Conditioning of a finite difference scheme on a uniform grid is also examined provided that this scheme is convergent. For the condition number of the scheme on a piecewise uniform grid, an ε-uniform bound O(δ ₁ ^?2 lnδ ₁ ^?1 + δ ₀ ^?1 ) is obtained, where δ₁ and δ₀ are the error components due to the approximation of the derivatives with respect to x and t, respectively. Thus, this scheme is ε-uniformly well-conditioned. For the condition number of the scheme on a uniform grid, we have the estimate O(ε^?1δ ₁ ^?2 + δ ₀ ^?1 ); this scheme is not ε-uniformly well-conditioned. In the case of the difference scheme on a uniform grid, there is an additional error due to perturbations of the grid solution; this error grows unboundedly as ε → 0, which reduces the accuracy of the grid solution (the number of correct significant digits in the grid solution is reduced). The condition numbers of the matrices of the schemes under examination are the same; both have an order of O(ε^?1δ ₁ ^?2 + δ ₀ ^?1 ). Neither the matrix of the ε-uniformly convergent scheme nor the matrix of the scheme on a uniform grid is ε-uniformly well-conditioned.     

Dominant dimensions,derived equivalences and tilting modules

We show that for every ? > 0 there exist δ > 0 and n₀ ∈ ? such that every 3-uniform hypergraph on n ≥ n₀ vertices with the property that every k-vertex subset, where k ≥ δn, induces at least \(\left( {\frac{1}{2} + \varepsilon } \right)\left( {\begin{array}{*{20}c} k \\ 3 \\ \end{array} } \right)\) edges, contains K₄^? as a subgraph, where K₄^? is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erd?s and Sós. The constant 1/4 is the best possible.     

A Refinement of Weak Order Intervals into Distributive Lattices

In this paper we consider arbitrary intervals in the left weak order on the symmetric group S _n . We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the rank-generating function of this distributive lattice matches that of the weak order interval. We construct a poset such that its lattice of order ideals is isomorphic to the lattice of Lehmer codes of permutations in the given interval. We show that there are at least ${\left(\lfloor {\frac{n}{2}} \rfloor \right)!}$ permutations in S _n that form a rank-symmetric interval in the weak order.     

Invariance of the generalized oscillator under a linear transformation of the related system of orthogonal polynomials

We consider the families of polynomials P = { P _n (x)} _n=0 ^∞ and Q = { Q _n (x)} _n=0 ^∞ orthogonal on the real line with respect to the respective probability measures μ and ν. We assume that { Q _n (x)} _n=0 ^∞ and {P _n (x)} _n=0 ^∞ are connected by linear relations. In the case k = 2, we describe all pairs (P,Q) for which the algebras A _P and A _Q of generalized oscillators generated by { Qn(x)} _n=0 ^∞ and { Pn(x)} _n=0 ^∞ coincide. We construct generalized oscillators corresponding to pairs (P,Q) for arbitrary k ≥ 1.     

Power Majorization and Majorization of Sequences

Let \(\bar x\) , \(\bar y\ \in\ R_n\) be vectors which satisfy x₁ ≥ x₂ ≥ … ≥ x_n and y₁ ≥ y₂ >- … ≥ y_n and Σx_i = Σy_i. We say that \(\bar x\) is power majorized by \(\bar y\) if Σx_i ^p ≤ Σy_i ^p for all real p ? [0, 1] and Σx_i ^p ≥ Σy_i ^p for p ∈ [0, 1]. In this paper we give a classification of functions ? (which includes all possible positive polynomials) for which \(\bar\phi(\bar x) \leq \bar\phi(\bar y)\) (see definition below) when \(\bar x\) is power majorized \(\bar y\) . We also answer a question posed by Clausing by showing that there are vectors \(\bar x\) , \(\bar y\ \in\ R^n\) of any dimension n ≥ 4 for which there is a convex function ? such that \(\bar x\) is power majorized by \(\bar y\) and \(\bar\phi(\bar x)\ >\ \bar\phi(\bar y)\) .     

Index sets of decidable models

We study the index sets of the class of d-decidable structures and of the class of d-decidable countably categorical structures, where d is an arbitrary arithmetical Turing degree. It is proved that the first of them is m-complete ∑ ₃ ^{0, d} , and the second is m-complete ∑ ₃ ^{0, d} \∑ ₃ ^{0, d} in the universal computable numbering of computable structures for the language with one binary predicate.