Applications of the Mellin transform in quantum calculus

In this paper, we study in quantum calculus the correspondence between poles of the q-Mellin transform (see [A. Fitouhi, N. Bettaibi, K. Brahim, The Mellin transform in Quantum Calculus, Constr. Approx. 23 (3) (2006) 305-323]) and the asymptotic behaviour of the original function at 0 and ∞. As applications, we give a new technique (in q-analysis) to derive the asymptotic expansion of some functions defined by q-integrals or by q-harmonic sums. Finally, a q-analogue of the Mellin-Perron formula is given.     

Some Gaussian binomial sum formulæ with applications

We introduce and compute some Gaussian q-binomial sums formulæ. In order to prove these sums, our approach is to use q-analysis, in particular a formula of Rothe, and computer algebra. We present some applications of our results.     

Primal-dual interior-point methods for PDE-constrained optimization

This paper provides a detailed analysis of a primal-dual interior-point method for PDE-constrained optimization. Considered are optimal control problems with control constraints in L ^p . It is shown that the developed primal-dual interior-point method converges globally and locally superlinearly. Not only the easier L ^∞-setting is analyzed, but also a more involved L ^q -analysis, q < ∞, is presented. In L ^∞, the set of feasible controls contains interior points and the Fréchet differentiability of the perturbed optimality system can be shown. In the L ^q -setting, which is highly relevant for PDE-constrained optimization, these nice properties are no longer available. Nevertheless, a convergence analysis is developed using refined techniques. In parti- cular, two-norm techniques and a smoothing step are required. The L ^q -analysis with smoothing step yields global linear and local superlinear convergence, whereas the L ^∞-analysis without smoothing step yields only global linear convergence.     

The golden ratio and super central configurations of the n-body problem

In this paper, we consider the problem of central configurations of the n-body problem with the general homogeneous potential 1/rα. A configuration q=(q₁,q₂,…,qn) is called a super central configuration if there exists a positive mass vector m=(m₁,…,mn) such that q is a central configuration for m with mi attached to qi and q is also a central configuration for m^′, where m^′≠m and m^′ is a permutation of m. The main discovery in this paper is that super central configurations of the n-body problem have surprising connections with the golden ratio φ. Let r be the ratio of the collinear three-body problem with the ordered positions q₁, q₂, q₃ on a line. q is a super central configuration if and only if 1/r₁(α)<r<r₁(α) and r≠1, where r₁(α)>1 is a continuous function such that , the golden ratio. The existence and classification of super central configurations are established in the collinear three-body problem with general homogeneous potential 1/rα. Super central configurations play an important role in counting the number of central configurations for a given mass vector which may decrease the number of central configurations under geometric equivalence.     

Constructing pairing-friendly hyperelliptic curves using Weil restriction

A pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become pairing-friendly over a finite extension of Fq. Our main proof technique is Weil restriction of elliptic curves. We describe adaptations of the Cocks-Pinch and Brezing-Weng methods that produce genus 2 curves with the desired properties. Our examples include a parametric family of genus 2 curves whose Jacobians have the smallest recorded ρ-value for simple, non-supersingular abelian surfaces.     

The generalized q-Pilbert matrix

A generalized q-Pilbert matrix from[KILIÇ, E.-PRODINGER, H.: The q-Pilbert matrix, Int. J. Comput. Math. 89 (2012), 1370–1377] is further generalized, introducing one additional parameter. Explicit formulæ are derived for the LU-decomposition and their inverses, as well as the Cholesky decomposition. The approach is to use q-analysis and to leave the justification of the necessary identities to the q-version of Zeilberger’s celebrated algorithm. However, the necessary identities have appeared already in disguised form in the paper referred above, so that no new computations are necessary.     

The generalized Lilbert matrix

We introduce a generalized Lilbert [Lucas-Hilbert] matrix. Explicit formulæ are derived for the LU-decomposition and their inverses, as well as the Cholesky decomposition. The approach is to use q-analysis and to leave the justification of the necessary identities to the q-version of Zeilberger’s celebrated algorithm.     

Zeros of entire functions and a problem of Ramanujan

We derive representations for certain entire q-functions and apply our technique to the Ramanujan entire function (or q-Airy function) and q-Bessel functions. This is used to show that the asymptotic series of the large zeros of the Ramanujan entire function and similar functions are also convergent series. The idea is to show that the zeros of the functions under consideration satisfy a nonlinear integral equation.     

Some <Emphasis Type="Italic">q</Emphasis>-inequalities for Hausdorff operators

We calculate the sharp bounds for some q-analysis variants of Hausdorff type inequalities of the form

$$\int_0^{ + \infty } {{{\left( {\int_0^{ + \infty } {\frac{{\phi \left( t \right)}}{t}f\left( {\frac{x}{t}} \right){d_q}t} } \right)}^p}{d_q}x} \leqslant {C_\phi }\int_0^b {{f^p}\left( t \right)} {d_q}t$$

. As applications, we obtain several sharp q-analysis inequalities of the classical positive integral operators, including the Hardy operator and its adjoint operator, the Hilbert operator, and the Hardy-Littlewood-Pólya operator.

     

Structure of vertex-transitive graphs

Every vertex-transitive graph has a characteristic structure. The specific details of structure of a vertex-transitive graph are closely related to the configuration of the parts of any minimum separating set of that graph. It is shown for a vertex-transitive graph G that (i) the number n of isomorphic atomic parts admitted by any minimum separating set S is unique for that G; (ii) G is then isomorphic to a disjoint union of m(≥2) copies of such a set of n atomic parts together with some additional edges joining them; (iii) any minimum separating set S of G consists of the vertex set of the union of some k(≥1) copies of the set of n atomic parts; (iv) at most one nonatomic part will be admitted in conjunction with one or more atomic parts by any minimum separating set of G.This configuration of structure extends to nonatomic parts. A vertex-transitive graph G may contain a not necessarily unique minimum separating set S which admits t(≥3) nonatomic parts. Then it is shown that (i) some (t ? 1)-set of these nonatomic parts are pairwise isomorphic; (ii) if the remaining nonatomic part is nonisomorphic to the others then it contains more vertices than the other parts; (iii) G is isomorphic to a disjoint union of d(≥2) copies of the set of q(≥t ? 1) isomorphic nonatomic parts together with some additional edges joining them; (iv) a minimum separating set S consists of the vertex set of the union of some y(≥1) copies of the set of q isomorphic nonatomic parts. For the case of t = 2 non-atomic parts admitted by a minimum separating set S, counterexamples of (iii) and (iv) are given.     

Q-analysis for modeling and decision making

This paper provides an overview of existing and potential applications of a system-theoretic approach called Q-analysis, using the examples of design and analysis of expert systems in medical image processing and analysis: namely the organization of a histopathologic knowledge base. Q-analysis is also applied to a multicriterion decision-making (MCDM) problem using a method called multicriterion Q-analysis (MCQA). A brief discussion of the advantages and limitations of Q-analysis is given, with suggestions for further applications.     

More about complements of quasi-uniformities

We continue our investigations on the lattice (q(X),⊆) of quasi-uniformities on a set X. Improving on earlier results, we show that the Pervin quasi-uniformity (resp. the well-monotone quasi-uniformity) of an infinite topological T₁-space X does not have a complement in (q(X),⊆). We also establish that a hereditarily precompact quasi-uniformity inducing the discrete topology on an infinite set X does not have a complement in (q(X),⊆).     

Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables

We present a hierarchy of semidefinite programming (SDP) relaxations for solving the concave cost transportation problem (CCTP), which is known to be NP-hard, with p suppliers and q demanders. In particular, we study cases in which the cost function is quadratic or square-root concave. The key idea of our relaxation methods is in the change of variables to CCTPs, and due to this, we can construct SDP relaxations whose matrix variables are of size O((min {p, q}) ^ω ) in the relaxation order ω. The sequence of optimal values of SDP relaxations converges to the global minimum of the CCTP as the relaxation order ω goes to infinity. Furthermore, the size of the matrix variables can be reduced to O((min {p, q}) ^ω-1 ), ω ≥  2 by using Reznick’s theorem. Numerical experiments were conducted to assess the performance of the relaxation methods.     

Algorithms for the q-model clustering problem with application in switching cabinet manufacturing

The model configuration problem (MCP) is a combinatorial optimization problem with application in the telecommunications manufacturing industry. The product is a switching cabinet, defined by a number of positions (slots) in which specific circuit packs are installed according to the customer requirements (configurations). Variety of customer requirements leads to a relatively large number of distinct configurations. In order to streamline the manufacturing process, a large number of switching cabinets with identical configurations (model cabinets) are produced in advance. A customer order is then filled by selecting a model cabinet whose configuration is relatively close to the customer configuration and performing any necessary circuit pack exchanges to make its configuration identical to the customer requirement. The manufacturing costs are proportional to the number of these circuit pack exchanges, and the q-model configuration problem is to design q different model configurations so as to minimize the total number of exchanges for a given collection of customer orders. We propose three heuristic algorithms for solving the q-model configuration problem and carry out a computational experiment to evaluate their effectiveness.     

Construction of pure states in mean field models for spin glasses

If a mean field model for spin glasses is generic in the sense that it satisfies the extended Ghirlanda–Guerra identities, and if the law of the overlaps has a point mass at the largest point q* of its support, we prove that one can decompose the configuration space into a sequence of sets (A _k ) such that, generically, the overlap of two configurations is equal to q* if and only if they belong to the same set A _k . For the study of the overlaps each set A _k can be replaced by a single point. Combining this with a recent result of Panchenko (A connection between Ghirlanda–Guerra identities and ultrametricity. Ann Probab (2008, to appear)) this proves that if the overlaps take only finitely many values, ultrametricity occurs. We give an elementary, self-contained proof of this result based on simple inequalities and an averaging argument.     

Vertex-algebraic structure of the principal subspaces of level one modules for the untwisted affine Lie algebras of types A,D,E

Generalizing some of our earlier work, we prove natural presentations of the principal subspaces of the level one standard modules for the untwisted affine Lie algebras of types A, D and E, and also of certain related spaces. As a consequence, we obtain a canonical complete set of recursions (q-difference equations) for the (multi-)graded dimensions of these spaces, and we derive their graded dimensions. Our methods are based on intertwining operators in vertex operator algebra theory.     

Basic Fourier Series: Convergence on and Outside the?q-Linear Grid

A q-type H?lder condition on a function f is given in order to establish (uniform) convergence of the corresponding basic Fourier series S _q [f] to the function itself, on the set of points of the q-linear grid. Furthermore, by adding other conditions, one guarantees the (uniform) convergence of S _q [f] to f on and ??outside?? the set points of the q-linear grid.     

Mutually orthogonal Latin squares based on general linear groups

Given a finite group G, how many squares are possible in a set of mutually orthogonal Latin squares based on G? This is a question that has been answered for a few classes of groups only, and for no nonsoluble group. For a nonsoluble group G, we know that there exists a pair of orthogonal Latin squares based on G. We can improve on this lower bound when G is one of GL(2, q) or SL(2, q), q a power of 2, q ≠ 2, or is obtained from these groups using quotient group constructions. For nonsoluble groups, that is the extent of our knowledge. We will extend these results by deriving new lower bounds for the number of squares in a set of mutually orthogonal Latin squares based on the group GL(n, q), q a power of 2, q ≠ 2.