Strong Normalizability of Typed Lambda-Calculi for Substructural Logics

The strong normalization theorem is uniformly proved for typed λ-calculi for a wide range of substructural logics with or without strong negation. We would like to thank the referees for their valuable comments and suggestions. This research was supported by the Alexander von Humboldt Foundation. The second author is grateful to the Foundation for providing excellent working conditions and generous support of this research. This work was also supported by the Japanese Ministry of Education, Culture, Sports, Science and Technology, Grant-in-Aid for Young Scientists (B) 20700015, 2008.     

Do we self-regulate actions or perceptions? A test of two computational models

Self-regulation theories in applied psychology disagree about whether action or perceptions are the focus of regulation. Computational models based on the two conceptualizations were constructed and simulated. In one scenario, they performed identically and in conjunction with participants in a study of the goal-level effect (Vancouver et al., Organ Res Methods 8:100–127, 2005). In another scenario they created differentiating predictions and only the computational model based on the self-regulation of perceptions matched the data of participants. Implications for research and practice are discussed.

Non-Walker Self-Dual Neutral Einstein Four-Manifolds of Petrov Type III

The local structure of the manifolds named in the title is described. Although curvature homogeneous, they are not, in general, locally homogeneous. Not all of them are Ricci-flat, which answers an existence question about type III Jordan-Osserman metrics, raised by Díaz-Ramos, García-Río and Vázquez-Lorenzo (J. Geom. Anal. 16, 39–52, 2006). Work begun during the author’s visit to the University of Santiago de Compostela, supported by Grant MTM2006-01432 (Spain).     

A Mathematica package for q-holonomic sequences and power series

We describe a Mathematica package for dealing with q-holonomic sequences and power series. The package is intended as a q-analogue of the Maple package gfun and the Mathematica package GeneratingFunctions. It provides commands for addition, multiplication, and substitution of these objects, for converting between various representations (q-differential equations, q-recurrence equations, q-shift equations), for computing sequence terms and power series coefficients, and for guessing recurrence equations given initial terms of a sequence. C. Koutschan partially supported by the Austrian Science Foundation (FWF) grants SFB F1305.     

Units of ℤ(Cp × C2) and ℤ(Cp × C2 × C2)

The goal of this article is to describe a multiplicatively independent set, which generates the group of units of the integral group ring ?G, where G is either the cyclic group of order 2p or C₂ × C₂ × C_p, for a prime number p that satisfies some suitable conditions that will be specified later.     

Existence of a periodic solution for continuous and discrete periodic second-order equations with variable potentials

Green’s functions for new second-order periodic differential and difference equations with variable potentials are found, then used as kernels in integral operators to guarantee the existence of a positive periodic solution to continuous and discrete second-order periodic boundary value problems with periodic coefficient functions. A new version of the Leggett-Williams fixed point theorem is employed.     

Asymptotic behavior for non-oscillatory solutions of difference equations with several delays in the neutral term

In this paper, we first consider difference equations with several delays in the neutral term of the form * $$\Delta\left(y_{n}+\sum_{i=1}^{L}p_{i}y_{n-{k_{i}}}-\sum_{j=1}^{M}r_{j}y_{n-{\rho_{j}}}\right)+q_{n}y_{n-\tau}=0\quad \mbox{for}\ n\in\mathbb{Z}^{+}(0),$$ study various cases of coefficients in the neutral term and obtain the asymptotic behavior for non-oscillatory solution of (*) under some hypotheses. Moreover, we consider reaction-diffusion difference equations with several delays in the neutral term of the form $$\begin{array}{l}\Delta_{1}\left(u_{n,m}+\displaystyle \sum_{i=1}^{L}p_{i}u_{n-{k_{i}},m}-\displaystyle \sum_{j=1}^{M}r_{j}u_{n-{\rho_{j}},m}\right)+q_{n,m}u_{n-\tau,m}\\[18pt]\quad {}=a^{2}\Delta_{2}^{2}u_{n+1,m-1}\end{array}$$ for (n,m)∈?⁺(0)×Ω, study various cases of coefficients in the neutral term and obtain the asymptotic behavior for non-oscillatory solution under some hypotheses.     

Limit Property for Regular and Weak Generalized Convolution

We denote by ? \((\mathcal{P_{+}})\) the set of all probability measures defined on the Borel subsets of the real line (the positive half-line [0,∞)). K. Urbanik defined the generalized convolution as a commutative and associative ?₊-valued binary operation ? on ? ₊ ² which is continuous in each variable separately. This convolution is distributive with respect to convex combinations and scale changes T _a (a>0) with δ ₀ as the unit element. The key axiom of a generalized convolution is the following: there exist norming constants c _n and a measure ν other than δ ₀ such that \(T_{c_{n}}\delta_{1}^{\bullet n}\to\nu\).In Sect. 2 we discuss basic properties of the generalized convolution on ? which hold for the convolutions without the key axiom. This rather technical discussion is important for the weak generalized convolution where the key axiom is not a natural assumption. In Sect. 4 we show that if the weak generalized convolution defined by a weakly stable measure μ has this property, then μ is a factor of strictly stable distribution.     

Martingale Approximation and Optimality of Some Conditions for the Central Limit Theorem

Let (X _i ) be a stationary and ergodic Markov chain with kernel Q and f an L ² function on its state space. If Q is a normal operator and f=(I?Q)^1/2 g (which is equivalent to the convergence of \(\sum_{n=1}^{\infty}\frac{\sum_{k=0}^{n-1}Q^{k}f}{n^{3/2}}\) in L ²), we have the central limit theorem [cf. (Derriennic and Lin in C.R. Acad. Sci. Paris, Sér. I 323:1053–1057, 1996; Gordin and Lif?ic in Third Vilnius conference on probability and statistics, vol. 1, pp. 147–148, 1981)]. Without assuming normality of Q, the CLT is implied by the convergence of \(\sum_{n=1}^{\infty}\frac{\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}}{n^{3/2}}\), in particular by \(\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}=o(\sqrt{n}/\log^{q}n)\), q>1 by Maxwell and Woodroofe (Ann. Probab. 28:713–724, 2000) and Wu and Woodroofe (Ann. Probab. 32:1674–1690, 2004), respectively. We show that if Q is not normal and f∈(I?Q)^1/2 L ², or if the conditions of Maxwell and Woodroofe or of Wu and Woodroofe are weakened to \(\sum_{n=1}^{\infty}c_{n}\frac{\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}}{n^{3/2}}<\infty\) for some sequence c _n ↘0, or by \(\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}=O(\sqrt{n}/\log n)\), the CLT need not hold.     

Dense Fast Random Projections and Lean Walsh Transforms

Random projection methods give distributions over k×d matrices such that if a matrix Ψ (chosen according to the distribution) is applied to a finite set of vectors x _i ∈ℝ ^d the resulting vectors Ψx _i ∈ℝ ^k approximately preserve the original metric with constant probability. First, we show that any matrix (composed with a random ±1 diagonal matrix) is a good random projector for a subset of vectors in ℝ ^d . Second, we describe a family of tensor product matrices which we term Lean Walsh. We show that using Lean Walsh matrices as random projections outperforms, in terms of running time, the best known current result (due to Matousek) under comparable assumptions.     

Arithmetic properties of partitions with odd parts distinct

In this work, we consider the function pod(n), the number of partitions of an integer n wherein the odd parts are distinct (and the even parts are unrestricted), a function which has arisen in recent work of Alladi. Our goal is to consider this function from an arithmetic point of view in the spirit of Ramanujan’s congruences for the unrestricted partition function p(n). We prove a number of results for pod(n) including the following infinite family of congruences: for all α≥0 and n≥0,

On the Existence of Optimal Unions of Subspaces for Data Modeling and Clustering

Given a set of vectors F={f ₁,…,f _m } in a Hilbert space H\mathcal {H}, and given a family C\mathcal {C} of closed subspaces of H\mathcal {H}, the subspace clustering problem consists in finding a union of subspaces in C\mathcal {C} that best approximates (is nearest to) the data F. This problem has applications to and connections with many areas of mathematics, computer science and engineering, such as Generalized Principal Component Analysis (GPCA), learning theory, compressed sensing, and sampling with finite rate of innovation. In this paper, we characterize families of subspaces C\mathcal {C} for which such a best approximation exists. In finite dimensions the characterization is in terms of the convex hull of an augmented set C⁺\mathcal {C}^{+}. In infinite dimensions, however, the characterization is in terms of a new but related notion; that of contact half-spaces. As an application, the existence of best approximations from π(G)-invariant families C\mathcal {C} of unitary representations of Abelian groups is derived.     

Remarks on a surplus-sharing rule from the Mishneh Torah

Rabbi Moshe ben Maimon (1135–1204), known as Moses Maimonides, ranks among the most distinguished philosophers of the Middle Ages. He is the renowned author of the Mishneh Torah, a comprehensive code of Jewish law. Book 12 (“Book of Acquisition”), Treatise 4 (“Agents and Partners”), of the Code of Maimonides is devoted in Chapter 4 to the allocation of the surplus from funds which a partnership invests in an indivisible input. The Rabbi’s case translates into a cooperative game where all intermediate coalitions are inessential. Standard axioms for cooperative-game solutions then suggest that the surplus be shared equally by the players, which is precisely the Maimonidean ruling. We show that this outcome can be preserved in spirit under much weaker assumptions on the worth of a game’s intermediate coalitions. We present results both for the nucleolus and the Shapley value of the underlying class of games.     

On the Differential Geometric Characterization of The Lee Models

This paper pertains to the J-Hermitian geometry of model domains introduced by Lee (Mich. Math. J. 54(1), 179–206, 2006; J. Reine Angew. Math. 623, 123–160, 2008). We first construct a Hermitian invariant metric on the Lee model and show that the invariant metric actually coincides with the Kobayashi-Royden metric, thus demonstrating an uncommon phenomenon that the Kobayashi-Royden metric is J-Hermitian in this case. Then we follow Cartan’s differential-form approach and find differential-geometric invariants, including torsion invariants, of the Lee model equipped with this J-Hermitian Kobayashi-Royden metric, and present a theorem that characterizes the Lee model by those invariants, up to J-holomorphic isometric equivalence. We also present an all dimensional analysis of the asymptotic behavior of the Kobayashi metric near the strongly pseudoconvex boundary points of domains in almost complex manifolds.     

Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds

Many real applications can be formulated as nonlinear minimization problems with a single linear equality constraint and box constraints. We are interested in solving problems where the number of variables is so huge that basic operations, such as the evaluation of the objective function or the updating of its gradient, are very time consuming. Thus, for the considered class of problems (including dense quadratic programs), traditional optimization methods cannot be applied directly. In this paper, we define a decomposition algorithm model which employs, at each iteration, a descent search direction selected among a suitable set of sparse feasible directions. The algorithm is characterized by an acceptance rule of the updated point which on the one hand permits to choose the variables to be modified with a certain degree of freedom and on the other hand does not require the exact solution of any subproblem. The global convergence of the algorithm model is proved by assuming that the objective function is continuously differentiable and that the points of the level set have at least one component strictly between the lower and upper bounds. Numerical results on large-scale quadratic problems arising in the training of support vector machines show the effectiveness of an implemented decomposition scheme derived from the general algorithm model.     

Control the Fibre Orientation Distribution at the Outlet of Contraction

A two dimensional model of the orientation distribution of fibres in a paper machine headbox is studied. The goal is to control the fibre orientation distribution at the outlet of contraction by changing its shape. The mathematical formulation leads to an optimization problem with control in coefficients of a linear convection-diffusion equation as the state problem. Then, the problem is expressed as an optimal control problem governed by variational forms. By using an embedding method, the class of admissible shapes is replaced by a class of positive Radon measures. The optimization problem in measure space is then approximated by a linear programming problem. The optimal measure representing optimal shape is approximated by the solution of this linear programming problem. In this paper, we have shown that the embedding method (embedding the admissible set into a subset of measures), successfully can be applied to shape variation design to a one dimensional headbox. The usefulness of this idea is that the method is not iterative and it does not need any initial guess of the solution.      

Pointwise Estimates for Laplace Equation. Applications to the Free Boundary of the Obstacle Problem with Dini Coefficients

In this paper we are interested in pointwise regularity of solutions to elliptic equations. In a first result, we prove that if the modulus of mean oscillation of Δu at the origin is Dini (in L ^p average), then the origin is a Lebesgue point of continuity (still in L ^p average) for the second derivatives D ² u. We extend this pointwise regularity result to the obstacle problem for the Laplace equation with Dini right hand side at the origin. Under these assumptions, we prove that the solution to the obstacle problem has a Taylor expansion up to the order 2 (in the L ^p average). Moreover we get a quantitative estimate of the error in this Taylor expansion for regular points of the free boundary. In the case where the right hand side is moreover double Dini at the origin, we also get a quantitative estimate of the error for singular points of the free boundary. Our method of proof is based on some decay estimates obtained by contradiction, using blow-up arguments and Liouville Theorems. In the case of singular points, our method uses moreover a refined monotonicity formula.      

Exterior Differential Systems Prolongations and Application to a Study of Two Nonlinear Partial Differential Equations

A generalized Korteweg-de Vries equation is formulated as an exterior differential system, which is used to determine the prolongation structure of the equation. The prolongation structure is obtained for several cases of the variable powers, and nontrivial algebras are determined. The analysis is extended to a differential system which gives the Camassa-Holm equation as a particular case. The subject of conservation laws is briefly discussed for each of the equations. A Bäcklund transformation is determined using one of the prolongations.     

On the order of a non-abelian representation group of a slim dense near hexagon

In this paper we study the possible orders of a non-abelian representation group of a slim dense near hexagon. We prove that if the representation group R of a slim dense near hexagon S is non-abelian, then R is a 2-group of exponent 4 and |R|=2 ^β , 1+NPdim(S)≤β≤1+dimV(S), where NPdim(S) is the near polygon embedding dimension of S and dimV(S) is the dimension of the universal representation module V(S) of S. Further, if β=1+NPdim(S), then R is necessarily an extraspecial 2-group. In that case, we determine the type of the extraspecial 2-group in each case. We also deduce that the universal representation group of S is a central product of an extraspecial 2-group and an abelian 2-group of exponent at most 4. This work was partially done when B.K. Sahoo was a Research Fellow at the Indian Statistical Institute, Bangalore Center with NBHM fellowship, DAE Grant 39/3/2000-R&D-II, Govt. of India.