Divisorial Linear Algebra of Normal Semigroup Rings

We investigate the minimal number of generators and the depth of divisorial ideals over normal semigroup rings. Such ideals are defined by the inhomogeneous systems of linear inequalities associated with the support hyperplanes of the semigroup. The main result is that for every bound C there exist, up to isomorphism, only finitely many divisorial ideals I such that (I)C. It follows that there exist only finitely many Cohen–Macaulay divisor classes. Moreover, we determine the minimal depth of all divisorial ideals and the behaviour of and depth in arithmetic progressions in the divisor class group.The results are generalized to more general systems of linear inequalities whose homogeneous versions define the semigroup in a not necessarily irredundant way. The ideals arising this way can also be considered as defined by the nonnegative solutions of an inhomogeneous system of linear diophantine equations.We also give a more ring-theoretic approach to the theorem on minimal number of generators of divisorial ideals: it turns out to be a special instance of a theorem on the growth of multigraded Hilbert functions.     

Vector Equilibrium Problems Under Asymptotic Analysis

Given a closed convex set K in Rⁿ; a vector function F:K×K R^m; a closed convex (not necessarily pointed) cone P(x) in ^m with non-empty interior, PP(x) Ø, various existence results to the problemfind xK such that F(x,y)- int P(x) y K under P(x)-convexity/lower semicontinuity of F(x,) and pseudomonotonicity on F, are established. Moreover, under a stronger pseudomonotonicity assumption on F (which reduces to the previous one in case m=1), some characterizations of the non-emptiness of the solution set are given. Also, several alternative necessary and/or sufficient conditions for the solution set to be non-empty and compact are presented. However, the solution set fails to be convex in general. A sufficient condition to the solution set to be a singleton is also stated. The classical case P(x)=^m ₊ is specially discussed by assuming semi-strict quasiconvexity. The results are then applied to vector variational inequalities and minimization problems. Our approach is based upon the computing of certain cones containing particular recession directions of K and F.     

Existence of an Angular Density of Roots of Entire Functions of Order Zero

We obtain sufficient conditions for the set of roots of an entire function of order zero of strongly regular growth to possess an angular density.     

The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

The Problem of Aliasing in Identifying Finite Parameter Continuous Time Stochastic Models

This note exposits the problem of aliasing in identifying finite parameter continuous time stochastic models, including econometric models, on the basis of discrete data. The identification problem for continuous time vector autoregressive models is characterised as an inverse problem involving a certain block triangular matrix, facilitating the derivation of an improved sufficient condition for the restrictions the parameters must satisfy in order that they be identified on the basis of equispaced discrete data. Sufficient conditions already exist in the literature but these conditions are not sharp and rule out plausible time series behaviour.     

Representing the mean residual life in terms of the failure rate

In survival or reliability studies, the mean residual life or life expectancy is an important characteristic of the model. Whereas the failure rate can be expressed quite simply in terms of the mean residual life and its derivative, the inverse problem—namely that of expressing the mean residual life in terms of the failure rate—typically involves an integral of a complicated expression. In this paper, we obtain simple expressions for the mean residual life in terms of the failure rate for certain classes of distributions which subsume many of the standard cases. Several results in the literature can be obtained using our approach. Additionally, we develop an expansion for the mean residual life in terms of Gaussian probability functions for a broad class of ultimately increasing failure rate distributions. Some examples are provided to illustrate the procedure.     

Stability analysis of impulsive control systems

This paper studies impulsive control systems. Several stability criteria are established by employing the method of Lyapunov functions. These criteria may be used for impulsive feedback control design. As an application, impulsive control of the Lorenz chaotic system is discussed. Numerical experiments are carried out for the control of the Lorenz system. It is shown that small and frequent impulses need to be used in order to stabilize the Lorenz system.     

On the spectral function of the Poisson–Voronoi cells

Denote by (t)=∑_n1e^−λ_nt, t>0, the spectral function related to the Dirichlet Laplacian for the typical cell of a standard Poisson–Voronoi tessellation in . We show that the expectation E(t), t>0, is a functional of the convex hull of a standard d-dimensional Brownian bridge. This enables us to study the asymptotic behaviour of E(t), when t→0⁺,+∞. In particular, we prove that the law of the first eigenvalue λ₁ of satisfies the asymptotic relation lnP{λ₁t}−2^dω_dj_(d−2)/2^d·t^−d/2 when t→0⁺, where ω_d and j_(d−2)/2 are respectively the Lebesgue measure of the unit ball in and the first zero of the Bessel function J_(d−2)/2.     

A continuous function space with a Faber basis

Let be compact with #S=∞ and let C(S) be the set of all real continuous functions on S. We ask for an algebraic polynomial sequence (P_n)_n=0^∞ with deg P_n=n such that every fC(S) has a unique representation f=∑_i=0^∞ α_iP_i and call such a basis Faber basis. In the special case of , 0<q<1, we prove the existence of such a basis. A special orthonormal Faber basis is given by the so-called little q-Legendre polynomials. Moreover, these polynomials state an example with A(S_q)≠U(S_q)=C(S_q), where A(S_q) is the so-called Wiener algebra and U(S_q) is the set of all fC(S_q) which are uniquely represented by its Fourier series.     

Normal families and uniqueness theorems for entire functions

There exists a set S with 3 elements such that if f is a non-constant entire function satisfying E(S,f)=E(S,f′), then f≡f′. The number 3 is best possible. The proof uses the theory of normal families in an essential way.