Möbius and triangle semigroups

The purpose of this paper is to describe the structures of the Möbius semigroup induced by the Möbius transformation group (?, SL(2,?)). In particular, we study stabilizer subsemigoups of Möbius semigroup via the triangle semigroup. In this work, we obtained a geometric interpretation of the least contraction coefficient function of the Möbius semigroup via the triangle semigroup and investigated an extension of stabilizer subsemigoups of the Möbius semigroup. Finally, we obtained a factorization of our stabilizer subsemigoups of the Möbius semigroup.     

From image processing to topological modelling with <Emphasis Type="Italic">p</Emphasis>-adic numbers

Encoding the hierarchical structure of images by p-adic numbers allows for image processing and computer vision methods motivated from arithmetic physics. The p-adic Polyakov action leads to the p-adic diffusion equation in low level vision. Hierarchical segmentation provides another way of p-adic encoding. Then a topology on that finite set of p-adic numbers yields a hierarchy of topological models underlying the image. In the case of chain complexes, the chain maps yield conditions for the existence of a hierarchy, and these can be expressed in terms of p-adic integrals. Such a chain complex hierarchy is a special case of a persistence complex from computational topology, where it is used for computing persistence barcodes for shapes. The approach is motivated by the observation that using p-adic numbers often leads to more efficient algorithms than their real or complex counterparts.     

Multivariate Hierarchical Copulas with Shocks

A transformation to obtain new multivariate hierarchical copulas, starting with an arbitrary copula, is introduced. In addition to the hierarchical structure, the presented construction principle explicitly supports singular components. These may be interpreted as the effect of local or global shocks to the underlying random variables. A large spectrum of dependence patterns can be achieved by the presented transformation, which seems promising for practical applications. Moreover, copulas arising from this construction are similarly admissible with respect to analytical tractability and sampling routines as the original copula. Finally, several well-known families of copulas may be interpreted as special cases.     

Cyclotomic Hecke Algebras of <Emphasis Type="Italic">G</Emphasis>(<Emphasis Type="Italic">r</Emphasis>, <Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)

In this note, we find a monomial basis of the cyclotomic Hecke algebra \({\mathcal{H}_{r,p,n}}\) of G(r,p,n) and show that the Ariki-Koike algebra \({\mathcal{H}_{r,n}}\) is a free module over \({\mathcal{H}_{r,p,n}}\), using the Gröbner-Shirshov basis theory. For each irreducible representation of \({\mathcal{H}_{r,p,n}}\), we give a polynomial basis consisting of linear combinations of the monomials corresponding to cozy tableaux of a given shape.     

A Generalized Quasilinearization Method for Nonlinear Second-Order Impulsive Differential Equations Involving the <Emphasis Type="Italic">p</Emphasis>-Laplacian

Using variational method and lower and upper solutions, we get a generalized quasilinearization method which construct an iterative scheme converging uniformly to a solution of a nonlinear second-order impulsive differential equations involving the p-Laplacian, and converging quadratically when p=2.     

Some new transformations for Bailey pairs and WP-Bailey pairs

We derive several new transformations relating WP-Bailey pairs. We also consider the corresponding transformations relating standard Bailey pairs, and as a consequence, derive some quite general expansions for products of theta functions which can also be expressed as certain types of Lambert series.     

Analysis of the consistency of a mixed integer programming-based multi-category constrained discriminant model

Classification is concerned with the development of rules for the allocation of observations to groups, and is a fundamental problem in machine learning. Much of previous work on classification models investigates two-group discrimination. Multi-category classification is less-often considered due to the tendency of generalizations of two-group models to produce misclassification rates that are higher than desirable. Indeed, producing “good” two-group classification rules is a challenging task for some applications, and producing good multi-category rules is generally more difficult. Additionally, even when the “optimal” classification rule is known, inter-group misclassification rates may be higher than tolerable for a given classification model. We investigate properties of a mixed-integer programming based multi-category classification model that allows for the pre-specification of limits on inter-group misclassification rates. The mechanism by which the limits are satisfied is the use of a reserved judgment region, an artificial category into which observations are placed whose attributes do not sufficiently indicate membership to any particular group. The method is shown to be a consistent estimator of a classification rule with misclassification limits, and performance on simulated and real-world data is demonstrated.     

A Markov-Nikolskii type inequality for absolutely monotone polynomials of order <Emphasis Type="Italic">K</Emphasis>

A function Q is called absolutely monotone of order k on an interval I if Q(x) ≥ 0, Q′(x) ≥ 0, …, Q(k)(x) ≥ 0, for all x ε I. An essentially sharp (up to a multiplicative absolute constant) Markov inequality for absolutely monotone polynomials of order k in L _p [−1, 1], p > 0, is established. One may guess that the right Markov factor is cn ²/k, and this indeed turns out to be the case. Similarly sharp results hold in the case of higher derivatives and Markov-Nikolskii type inequalities. There is also a remarkable connection between the right Markov inequality for absolutely monotone polynomials of order k in the supremum norm and essentially sharp bounds for the largest and smallest zeros of Jacobi polynomials. This is discussed in the last section of the paper.     

On the First Hitting Time of a One-dimensional Diffusion and a Compound Poisson Process

It is studied the first-passage time (FPT) of a time homogeneous one-dimensional diffusion, driven by the stochastic differential equation dX(t) = μ(X(t))dt + σ(X(t)) dB _t , X(0) = x ₀, through b + Y(t), where b > x ₀ and Y(t) is a compound Poisson process with rate λ > 0 starting at 0, which is independent of the Brownian motion B _t . In particular, the FPT density is investigated, generalizing a previous result, already known in the case when X(t) = μt + B _t , for which the FPT density is the solution of a certain integral equation. A numerical method is shown to calculate approximately the FPT density; some examples and numerical results are also reported.     

Efficient three-step iterative methods with sixth order convergence for nonlinear equations

In this paper, we present two new three-step iterative methods for solving nonlinear equations with sixth convergence order. The new methods are obtained by composing known methods of third order of convergence with Newton’s method and using an adequate approximation for the derivative, that provides high order of convergence and reduces the required number of functional evaluations per step. The first method is obtained from Potra-Pták’s method and the second one, from Homeier’s method, both reaching an efficiency index of 1.5651. Our methods are comparable with the method of Parhi and Gupta (Appl Math Comput 203:50–55, 2008). Methods proposed by Kou and Li (Appl Math Comput 189:1816–1821, 2007), Wang et al. (Appl Math Comput 204:14–19, 2008) and Chun (Appl Math Comput 190:1432–1437, 2007) reach the same efficiency index, although they start from a fourth order method while we use third order methods and simpler arithmetics. We prove the convergence results and check them with several numerical tests that allow us to compare the convergence order, the computational cost and the efficiency order of our methods with those of the original methods.