Some constraint qualifications for quasiconvex vector-valued systems

In this paper, we consider minimization problems with a quasiconvex vector-valued inequality constraint. We propose two constraint qualifications, the closed cone constraint qualification for vector-valued quasiconvex programming (the VQ-CCCQ) and the basic constraint qualification for vector-valued quasiconvex programming (the VQ-BCQ). Based on previous results by Benoist et al. (Proc Am Math Soc 13:1109–1113, 2002), and Suzuki and Kuroiwa (J Optim Theory Appl 149:554–563, 2011), and (Nonlinear Anal 74:1279–1285, 2011), we show that the VQ-CCCQ (resp. the VQ-BCQ) is the weakest constraint qualification for Lagrangian-type strong (resp. min–max) duality. As consequences of the main results, we study semi-definite quasiconvex programming problems in our scheme, and we observe the weakest constraint qualifications for Lagrangian-type strong and min–max dualities. Finally, we summarize the characterizations of the weakest constraint qualifications for convex and quasiconvex programming.     

An improvement of discrete Tardos fingerprinting codes

It has been proven that the code lengths of Tardos’s collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos’s codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos’s codes. For example, when c = 8, our code length is about 4.94% of Tardos’s code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos’s codes. A part of this work was presented at 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17), Bangalore, India, December 16–20, 2007.     

On ideals with the Rees property

A homogeneous ideal I of a polynomial ring S is said to have the Rees property if, for any homogeneous ideal ${J \subset S}$ which contains I, the number of generators of J is smaller than or equal to that of I. A homogeneous ideal ${I \subset S}$ is said to be ${\mathfrak{m}}$ -full if ${\mathfrak{m}I:y=I}$ for some ${y \in \mathfrak{m}}$ , where ${\mathfrak{m}}$ is the graded maximal ideal of ${S}$ . It was proved by one of the authors that ${\mathfrak{m}}$ -full ideals have the Rees property and that the converse holds in a polynomial ring with two variables. In this note, we give examples of ideals which have the Rees property but are not ${\mathfrak{m}}$ -full in a polynomial ring with more than two variables. To prove this result, we also show that every Artinian monomial almost complete intersection in three variables has the Sperner property.     

Algebraic Shifting of Finite Graphs

In the present article, for bipartite graphs and chordal graphs, their exterior algebraic shifted graph and their symmetric algebraic shifted graph are studied. First, we will determine the symmetric algebraic shifted graph of complete bipartite graphs. It turns out that for a ≥ 3 and b ≥ 3, the exterior algebraic shifted graph of the complete bipartite graph K _a,b of size a, b is different from the symmetric algebraic shifted graph of K _a,b . Second, we will show that the exterior algebraic shifted graph of any chordal graph G coincides with the symmetric algebraic shifted graph of G. In addition, it will be shown that the exterior algebraic shifted graph of any chordal graph G is equal to some combinatorial shifted graph of G.     

Duality Theorems for Separable Convex Programming Without Qualifications

In the research of mathematical programming, duality theorems are essential and important elements. Recently, Lagrange duality theorems for separable convex programming have been studied. Tseng proves that there is no duality gap in Lagrange duality for separable convex programming without any qualifications. In other words, although the infimum value of the primal problem equals to the supremum value of the Lagrange dual problem, Lagrange multiplier does not always exist. Jeyakumar and Li prove that Lagrange multiplier always exists without any qualifications for separable sublinear programming. Furthermore, Jeyakumar and Li introduce a necessary and sufficient constraint qualification for Lagrange duality theorem for separable convex programming. However, separable convex constraints do not always satisfy the constraint qualification, that is, Lagrange duality does not always hold for separable convex programming. In this paper, we study duality theorems for separable convex programming without any qualifications. We show that a separable convex inequality system always satisfies the closed cone constraint qualification for quasiconvex programming and investigate a Lagrange-type duality theorem for separable convex programming. In addition, we introduce a duality theorem and a necessary and sufficient optimality condition for a separable convex programming problem, whose constraints do not satisfy the Slater condition.     

Large time WKB approximation for multi-dimensional semiclassical Schrödinger-Poisson system

We consider the semiclassical Schrödinger-Poisson system with a special initial data of WKB type such that the solution of the limiting hydrodynamical equation becomes time-global in dimensions at least three. We give an example of such initial data in the focusing case via the analysis of the compressible Euler-Poisson equations. This example is a large data with radial symmetry, and is beyond the reach of the previous results because the phase part decays too slowly. Extending previous results in this direction, we justify the WKB approximation of the solution with this data for an arbitrarily large interval of R₊.     

Some Geometry of the Cone of Nonnegative Definite Matrices and Weights of Associated X2 Distribution

Consider the test problem about matrix normal mean M with the null hypothesis M = O against the alternative that M is nonnegative definite. In our previous paper (Kuriki (1993, Ann. Statist., 21, 1379–1384)), the null distribution of the likelihood ratio statistic has been given in the form of a finite mixture of ² distributions referred to as X² distribution. In this paper, we investigate differential-geometric structure such as second fundamental form and volume element of the boundary of the cone formed by real nonnegative definite matrices, and give a geometric derivation of this null distribution by virtue of the general theory on the X² distribution for piecewise smooth convex cone alternatives developed by Takemura and Kuriki (1997, Ann. Statist., 25, 2368–2387).     

Superior Electron‐Transport Ability of π‐Conjugated Redox Molecular Wires Prepared by the Stepwise Coordination Method on a Surface

Electronic conductivity of molecular wires is a critical fundamental issue in molecular electronics. π‐Conjugated redox molecular wires with the superior long‐range electron‐transport ability could be constructed on a gold surface through the stepwise ligand–metal coordination method. The β^d value, indicating the degree of decrease in the electron‐transfer rate constant with distance along the molecular wire between the electrode and the redox active species at the terminal of the wire, were 0.008–0.07 Å^?1 and 0.002–0.004 Å^?1 for molecular wires of bis(terpyridine)iron and bis(terpyridine)cobalt complex oligomers, respectively. The influences on β^d by the chemical structure of molecular wires and the terminal redox units, temperature, electric field, and electrolyte concentration were clarified. The results indicate that facile sequential electron hopping between neighboring metal–complex units within the wire is responsible for the high electron‐transport ability.