Knapp-Wallach Szegö integrals and generalized principal series representations: The parabolic rank one case

To each discrete series representation of a connected semisimple Lie group G with finite center, a G-equivariant embedding into a generalized principal series representation is given. This representation is induced from specified parameters on a maximal parabolic subgroup of G and the mapping is defined by an integral formula, analogous to the Szegö integral introduced by Knapp and Wallach for a minimal parabolic subgroup. In a limiting case, embeddings of limits of discrete series representations are obtained and used to exhibit a reducibility theorem.     

Weighted zeta functions for quotients of regular coverings of graphs

Let G be a connected graph. We reformulate Stark and Terras' Galois Theory for a quotient H of a regular covering K of a graph G by using voltage assignments. As applications, we show that the weighted Bartholdi L-function of H associated to the representation of the covering transformation group of H is equal to that of G associated to its induced representation in the covering transformation group of K. Furthermore, we express the weighted Bartholdi zeta function of H as a product of weighted Bartholdi L-functions of G associated to irreducible representations of the covering transformation group of K. We generalize Stark and Terras' Galois Theory to digraphs, and apply to weighted Bartholdi L-functions of digraphs.     

Degenerate series representations of the universal covering group of SU(2, 2)

We prove a reducibility criterion for certain families of representations induced from irreducible finite dimensional representations of the 11-dimensional parabolic subgroup of the universal covering group of SU(2, 2). If an induced representation is reducible and can be considered as a representation of SU(2, 2) as well, we compute the number of composition factors.     

Spineurs symplectiques purs et indice de Maslov de plans lagrangiens positifs

As is well known, each point of the closed generalized unit-disk X can be associated to a holomorphically induced representation of the Heisenberg group. First canonical intertwining operators are constructed between pairs of such representations. Next, after having introduced suitable definitions, it is noted that the classical correspondence between group extensions and 2-cocycles also makes sense when applied to transformation spaces. As an example of transformation space extension, the manifold of pure symplectic spinors is described. It is the analogue of the manifold of pure spinors when the spin representation of the Clifford algebra is replaced by the Stone-Von Neumann representation of the Heisenberg group. Then, the associated 2-cocycle m₂ is worked out, which is a $\text{T}$-valued function on X × X × X, and the composition law of the canonical intertwining operators is given. Lifting m₂, an $\text{R}$-valued 2-cocycle m is constructed whose restriction to the Shilov boundary of X takes integer values and coincides with the ordinary Maslov index. For this reason, it is called the generalized Maslov index. Finally, using these results, explicit realizations of the metaplectic group, its Shale-Weil representation, and the universal covering of the symplectic group are given.     

Criteria for Feller transition functions

This paper presents some conditions for the minimal Q-function to be a Feller transition function, for a given q-matrix Q. We derive a sufficient condition that is stated explicitly in terms of the transition rates. Furthermore, some necessary and sufficient conditions are derived of a more implicit nature, namely in terms of properties of a system of equations (or inequalities) and in terms of the operator induced by the q-matrix. The criteria lead to some perturbation results. These results are applied to birth-death processes with killing, yielding some sufficient and some necessary conditions for the Feller property directly in terms of the rates. An essential step in the analysis is the idea of associating the Feller property with individual states.     

On computing minimal <Emphasis Type="Italic">H</Emphasis>-eigenvalue of sign-structured tensors

Finding the minimal H-eigenvalue of tensors is an important topic in tensor computation and numerical multilinear algebra. This paper is devoted to a sum-of-squares (SOS) algorithm for computing the minimal H-eigenvalues of tensors with some sign structures called extended essentially nonnegative tensors (EEN-tensors), which includes nonnegative tensors as a subclass. In the even-order symmetric case, we first discuss the positive semi-definiteness of EEN-tensors, and show that a positive semi-definite EEN-tensor is a nonnegative tensor or an M-tensor or the sum of a nonnegative tensor and an M-tensor, then we establish a checkable sufficient condition for the SOS decomposition of EEN-tensors. Finally, we present an efficient algorithm to compute the minimal H-eigenvalues of even-order symmetric EEN-tensors based on the SOS decomposition. Numerical experiments are given to show the efficiency of the proposed algorithm.     

Coverings by minimal transversals

In this paper, we give counterexamples to the conjecture: “Every nonempty regular simple graph contains two disjoint maximal independent sets” [2, 7]. For this, we generalize this problem to the following: covering the set of vertices of a graph by minimal transversals. An equivalence of this last problem is given.     

Embeddings of minimal non-abelian p-groups

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. For a given finite group G, let p(G) denote the minimal degree of a faithful representation of G by permutation matrices, and let c(G) denote the minimal degree of a faithful representation of G by quasi-permutation matrices. See [4]. It is easy to see that c(G) is a lower bound for p(G). Behravesh [H. Behravesh, The minimal degree of a faithful quasi-permutation representation of an abelian group, Glasg. Math. J. 39 (1) (1997) 51-57] determined c(G) for every finite abelian group G and also [H. Behravesh, Quasi-permutation representations of p-groups of class 2, J. Lond. Math. Soc. (2) 55 (2) (1997) 251-260] gave the algorithm of c(G) for each finite group G. In this paper, we first improve this algorithm and then determine c(G) and p(G) for an arbitrary minimal non-abelian p-group G.     

Branching laws for minimal holomorphic representations

In this paper we study the branching law for the restriction from SU(n,m) to SO(n,m) of the minimal representation in the analytic continuation of the scalar holomorphic discrete series. We identify the group decomposition with the spectral decomposition of the action of the Casimir operator on the subspace of S(O(n)×O(m))-invariants. The Plancherel measure of the decomposition defines an L²-space of functions, for which certain continuous dual Hahn polynomials furnish an orthonormal basis. It turns out that the measure has point masses precisely when n−m>2. Under these conditions we construct an irreducible representation of SO(n,m), identify it with a parabolically induced representation, and construct a unitary embedding into the representation space for the minimal representation of SU(n,m).     

A characterization of finite symplectic polar spaces of odd prime order

A sufficient condition for the representation group for a nonabelian representation (Definition 1.1) of a finite partial linear space to be a finite p-group is given (Theorem 2.9). We characterize finite symplectic polar spaces of rank r at least two and of odd prime order p as the only finite polar spaces of rank at least two and of prime order admitting nonabelian representations. The representation group of such a polar space is an extraspecial p-group of order p1+2r and of exponent p (Theorems 1.5 and 1.6).     

A modified goal programming model for piecewise linear functions

Piecewise linear function (PLF) is an important technique for solving polynomial and/or posynomial programming problems since the problems can be approximately represented by the PLF. The PLF can also be solved using the goal programming (GP) technique by adding appropriate linearization constraints. This paper proposes a modified GP technique to solve PLF with n terms. The proposed method requires only one additional constraint, which is more efficient than some well-known methods such as those proposed by Charnes and Cooper's, and Li. Furthermore, the proposed model (PM) can easily be applied to general polynomial and/or posynomial programming problems.     

Dual and Feller-Reuter-Riley transition functions

In this paper, we investigate duality and Feller-Reuter-Riley (FRR) property of continuous-time Markov chains (CTMCs). A criterion of dual q-functions is given in terms of their q-matrices. For a dual q-matrix Q, a necessary and sufficient conditions for the minimal Q-function to be a FRR transition function are also given. Finally, by using dual technique, we give a criterion of FRR Q-functions when Q is monotone.     

Attractor minimal sets for cooperative and strongly convex delay differential systems

We study the skew-product semiflow induced by a family of convex and cooperative delay differential systems. Under some monotonicity assumptions, we obtain an ergodic representation for the upper Lyapunov exponent of a minimal subset. In addition, when eventually strong convexity at one point is assumed and there exist two completely strongly ordered minimal subsets K₁?_CK₂, we show that K₁ is an attractor subset which is a copy of the base. The long-time behaviour of every trajectory strongly ordered with K₂ is then deduced. Some examples of application of the theory are shown.     

Undesirable facility location with minimal covering objectives

An undesirable facility is to be located within some feasible region of any shape in the plane or on a planar network. Population is supposed to be concentrated at a finite number n of points. Two criteria are taken into account: a radius of influence to be maximised, indicating within which distance from the facility population disturbance is taken into consideration, and the total covered population, i.e. lying within the influence radius from the facility, which should be minimised. Low complexity polynomial algorithms are derived to determine all nondominated solutions, of which there are only O(n³) for a fixed feasible region or O(n²) when locating on a planar network. Once obtained, this information allows almost instant answers and a trade-off sensitivity analysis to questions such as minimising the population within a given radius (minimal covering problem) or finding the largest circle not covering more than a given total population.     

Some characterizations of minimal Markov basis for sampling from discrete conditional distributions

In this paper we given some basic characterizations of minimal Markov basis for a connected Markov chain, which is used for performing exact tests in discrete exponential families given a sufficient statistic. We also give a necessary and sufficient condition for uniqueness of minimal Markov basis. A general algebraic algorithm for constructing a connected Markov chain was given by Diaconis and Sturmfels (1998,The Annals of Statistics,26, 363–397). Their algorithm is based on computing Gröbner basis for a certain ideal in a polynomial ring, which can be carried out by using available computer algebra packages. However structure and interpretation of Gröbner basis produced by the packages are sometimes not clear, due to the lack of symmetry and minimality in Gröbner basis computation. Our approach clarifies partially ordered structure of minimal Markov basis.     

Characterizing and computing minimal cograph completions

A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is a vertex incremental algorithm to compute a minimal cograph completion H of an arbitrary input graph G in O(|V(H)|+|E(H)|) time. An extended abstract of the result has been already presented at FAW 2008 [D. Lokshtanov, F. Mancini, C. Papadopoulos, Characterizing and computing minimal cograph completions, in: Proceedings of FAW’08-2nd International Frontiers of Algorithmics Workshop, in: LNCS, vol. 5059, 2008, pp. 147158. [1]].     

Approximation of eigenvalues below the essential spectra of singular second-order symmetric linear difference equations

This paper is concerned with approximation of eigenvalues below the essential spectra of singular second-order symmetric linear difference equations with at least one endpoint in the limit point case. A sufficient condition is firstly given for that the k-th eigenvalue of a self-adjoint subspace (relation) below its essential spectrum is exactly the limit of the k-th eigenvalues of a sequence of self-adjoint subspaces. Then, by applying it to singular second-order symmetric linear difference equations, the approximation of eigenvalues below the essential spectra is obtained, i.e., for any given self-adjoint subspace extension of the corresponding minimal subspace, its k-th eigenvalue below its essential spectrum is exactly the limit of the k-th eigenvalues of a sequence of constructed induced regular self-adjoint subspace extensions.     

Representation theorems for L-fuzzy quantities

In this paper representation theorems are given for L-fuzzy quantities, which permit a better understanding of fuzziness. In particular representation theorems due to Negoita and Ralescu [17] and to Sherwood and Taylor [23] are extended to the scope of complete and Brouwerian lattices.