Flippable Pairs and Subset Comparisons in Comparative Probability Orderings

We show that every additively representable comparative probability order on n atoms is determined by at least n–1 binary subset comparisons. We show that there are many orders of this kind, not just the lexicographic order. These results provide answers to two questions of Fishburn et al. (Math. Oper. Res. 27:227–243, 2002). We also study the flip relation on the class of all comparative probability orders introduced by Maclagan. We generalise an important theorem of Fishburn, Pekeč and Reeds, by showing that in any minimal set of comparisons that determine a comparative probability order, all comparisons are flippable. By calculating the characteristics of the flip relation for n=6 we discover that the polytopes associated with the regions in the corresponding hyperplane arrangement can have no more than 13 facets and that there are 20 regions whose associated polytopes have 13 facets. All the neighbours of the 20 comparative probability orders which correspond to those regions are representable. Research partially supported by the N.Z. Centres of Research Excellence Fund (grant UOA 201).     

Contact Interaction of Faces of the Plane Crack under Harmonic Loading

The present work is devoted to the solution of the three-dimensional fracture mechanics problem for a linear elastic, homogeneous and isotropic solid with a stationary plane crack under normal time-harmonic loading. The problem has been solved by the method of boundary integral equations with the allowance for the contact interaction of the opposite faces of the crack. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Coloring of Plane Graphs with Unique Maximal Colors on Faces

The Four Color Theorem asserts that the vertices of every plane graph can be properly colored with four colors. Fabrici and Göring conjectured the following stronger statement to also hold: the vertices of every plane graph can be properly colored with the numbers 1, …, 4 in such a way that every face contains a unique vertex colored with the maximal color appearing on that face. They proved that every plane graph has such a coloring with the numbers 1, …, 6. We prove that every plane graph has such a coloring with the numbers 1, …, 5 and we also prove the list variant of the statement for lists of sizes seven.     

Correction: An Application of Free Probability to Arithmetic Functions

In this paper, we study free probability on tensor product algebra \(\mathfrak {M} = M\,\otimes _{\mathbb {C}}\,{\mathcal {A}}\) of a \(W^{*}\)-algebra M and the algebra \({\mathcal {A}}\), consisting of all arithmetic functions equipped with the functional addition and the convolution. We study free-distributional data of certain elements of \(\mathfrak {M}\), and study freeness on \(\mathfrak {M}\), affected by fixed primes.     

Free Pairs of Bicyclic Units in the Integral Group Ring of the Dihedral Group

Hirano studied the quasi-Armendariz property of rings, and then this concept was generalized by some authors, defining quasi-Armendariz property for skew polynomial rings and monoid rings. In this article, we consider unified approach to the quasi-Armendariz property of skew power series rings and skew polynomial rings by considering the quasi-Armendariz condition in mixed extension ring [R; I][x; σ], introducing the concept of so-called (σ, I)-quasi Armendariz ring, where R is an associative ring equipped with an endomorphism σ and I is an σ-stable ideal of R. We study the ring-theoretical properties of (σ, I)-quasi Armendariz rings, and we obtain various necessary or sufficient conditions for a ring to be (σ, I)-quasi Armendariz. Constructing various examples, we classify how the (σ, I)-quasi Armendariz property behaves under various ring extensions. Furthermore, we show that a number of interesting properties of an (σ, I)-quasi Armendariz ring R such as reflexive and quasi-Baer property transfer to its mixed extension ring and vice versa. In this way, we extend the well-known results about quasi-Armendariz property in ordinary polynomial rings and skew polynomial rings for this class of mixed extensions. We pay also a particular attention to quasi-Gaussian rings.     

Analytical Solutions to the 3D Problem on Free Vibrations of an Orthotropic Cuboid with Free Faces

Mechanics of Composite Materials - Analytical solutions of the problem on free vibrations of an orthotropic cuboid with free faces, based on the use of trigonometric functions as base ones in all...     

Ternary Operations as Primitive Notions for Constructive Plane Geometry IV

In this paper we provide a quantifier-free constructive axiomatization for Euclidean planes in a first-order language with only ternary operation symbols and three constant symbols (to be interpreted as ‘points’). We also determine the algorithmic theories of some ‘naturally occurring’ plane geometries. Mathematics Subject Classification: 03F65, 51M05, 51M15, 03B30.     

On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces

 We prove that each 3-connected plane graph G without triangular or quadrangular faces either contains a k-path P _k , a path on k vertices, such that each of its k vertices has degree ≤5/3k in G or does not contain any k-path. We also prove that each 3-connected pentagonal plane graph G which has a k-cycle, a cycle on k vertices, k∈ {5,8,11,14}, contains a k-cycle such that all its vertices have, in G, bounded degrees. Moreover, for all integers k and m, k≥ 3, k∉ {5,8,11,14} and m≥ 3, we present a graph in which every k-cycle contains a vertex of degree at least m. Received: June 29, 1998 Final version received: April 11, 2000     

Bayesian Inference for Extremes: Accounting for the Three Extremal Types

The Extremal Types Theorem identifies three distinct types of extremal behaviour. Two different strategies for statistical inference for extreme values have been developed to exploit this asymptotic representation. One strategy uses a model for which the three types are combined into a unified parametric family with the shape parameter of the family determining the type: positive (Fréchet), zero (Gumbel), and negative (negative Weibull). This form of approach never selects the Gumbel type as that type is reduced to a single point in a continuous parameter space. The other strategy first selects the extremal type, based on hypothesis tests, and then estimates the best fitting model within the selected type. Such approaches ignore the uncertainty of the choice of extremal type on the subsequent inference. We overcome these deficiencies by applying the Bayesian inferential framework to an extended model which explicitly allocates a non-zero probability to the Gumbel type. Application of our procedure suggests that the effect of incorporating the knowledge of the Extremal Types Theorem into the inference for extreme values is to reduce uncertainty, with the degree of reduction depending on the shape parameter of the true extremal distribution and the prior weight given to the Gumbel type.     

The Atoms of the Free Multiplicative Convolution of Two Probability Distributions

We determine the atoms of the free multiplicative convolution of two measures supported on the unit circle or on the positive real line. Analogous results were proved earlier for free additive convolution. Submitted: January 20, 2002?Revised: March 20, 2002.     

Central and Non-central Limit Theorems in a Free Probability Setting

Long-range dependence in time series may yield non-central limit theorems. We show that there are analogous time series in free probability with limits represented by multiple Wigner integrals, where Hermite processes are replaced by non-commutative Tchebycheff processes. This includes the non-commutative fractional Brownian motion and the non-commutative Rosenblatt process.     

A Problem of Extreme Decomposition of the Complex Plane with Free Poles

Ukrainian Mathematical Journal - We study the problem of nonoverlapping domains with free poles on radial systems. Our main results strengthen and generalize several known results obtained in the...     

Extremes of Shepp statistics for the Wiener process

Define , where W(·) is a standard Wiener process. We study the maximum of Y up to time T: and de termine an asymptotic expression for when u→ ∞. Further we establish the limiting Gumbel distribution of M _T when T→ ∞ and present the corresponding normalization sequence.      

Rates of Convergence for Bivariate Extremes

Under a second order regular variation condition, rates of convergence of the distribution of bivariate extreme order statistics to its limit distribution are given both in the total variation metric and in the uniform metric.     

Pairs of Projections: Geodesics,Fredholm and Compact Pairs

A pair \((P, Q)\) of orthogonal projections in a Hilbert space \( \mathcal{H} \) is called a Fredholm pair if $$\begin{aligned} QP : R(P) \rightarrow R(Q) \end{aligned}$$ is a Fredholm operator. Let \( \mathcal{F} \) be the set of all Fredholm pairs. A pair is called compact if \(P-Q\) is compact. Let \( \mathcal{C} \) be the set of all compact pairs. Clearly \( \mathcal{C} \subset \mathcal{F} \) properly. In this paper it is shown that both sets are differentiable manifolds, whose connected components are parametrized by the Fredholm index. In the process, pairs \(P, Q\) that can be joined by a geodesic (or equivalently, a minimal geodesic) of the Grassmannian of \( \mathcal{H} \) are characterized: this happens if and only if $$\begin{aligned} \dim (R(P)\cap N(Q))=\dim (R(Q)\cap N(P)). \end{aligned}$$