Tangent Processes on Wiener Space

This paper deals with the study of the Malliavin calculus of Euclidean motions on Wiener space (i.e. transformations induced by general measure-preserving transformations, called “rotations”, and H-valued shifts) and the associated flows on abstract Wiener spaces.     

The inequality-satisfiability problem

We define a generalization of the satisfiability problem (SAT) where each “clause” is an or-list of inequalities in n variables. This problem is NP-complete even when containing only two inequalities per “clause”, but solvable in polynomial time when either the number of variables or the number of “clauses” is fixed.     

Self-dual, not self-polar

The smallest number of points of an incidence structure which is self-dual but not self-polar is 7. For non-binary structures (where a “point” may occur more than once in a “block”) the number is 6.     

Lifted generalized permutahedra and composition polynomials

Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a “lifting” construction for these polytopes, which turns an n  -dimensional generalized permutahedron into an (n+1)$(n+1)$-dimensional one. We prove that this construction gives rise to Stasheff ?s multiplihedron from homotopy theory, and to the more general “nestomultiplihedra”, answering two questions of Devadoss and Forcey.     

Menke points on the real line and their connection to classical orthogonal polynomials

We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show that these extremal points for the intervals [−1,1], [0,∞) and (−∞,∞), which are analogues of Menke points for a closed curve, are related to the zeros and extrema of classical orthogonal polynomials. Use of external fields in the form of suitable weight functions instead of constraints motivates the study of “weighted Menke points” on [0,∞) and (−∞,∞). We also discuss the asymptotic behavior of the Lebesgue constant for the Menke points on [−1,1].     

Counting strings in Dyck paths

This paper deals with the enumeration of Dyck paths according to the statistic “number of occurrences of τ”, for an arbitrary string τ. In this direction, the statistic “number of occurrences of τ at height j” is considered. It is shown that the corresponding generating function can be evaluated with the aid of Chebyshev polynomials of the second kind. This is applied to every string of length 4. Further results are obtained for the statistic “number of occurrences of τ at even (or odd) height”.     

Accelerated algorithm for pattern detection in logical analysis of data

Sets of “positive” and “negative” points (observations) in n-dimensional discrete space given along with their non-negative integer multiplicities are analyzed from the perspective of the Logical Analysis of Data (LAD). A set of observations satisfying upper and/or lower bounds imposed on certain components is called a positive pattern if it contains some positive observations and no negative one. The number of variables on which such restrictions are imposed is called the degree of the pattern. A total polynomial algorithm is proposed for the enumeration of all patterns of limited degree, and special efficient variants of it for the enumeration of all patterns with certain “sign” and “coverage” requirements are presented and evaluated on a publicly available collection of benchmark datasets.     

Completing Diophantus, De polygonis numeris, prop. 5

The last proposition of Diophantus’ De polygonis numeris, inquiring the number of ways that a number can be polygonal and apparently aiming at “simplifying” the definitory relation established by Diophantus himself, is incomplete. Past completions of this proposition are reported in detail and discussed, and a new route to a “simplified” relation is proposed, simpler, more transparent and more “Greek looking” than the others. The issue of the application of such a simplified relation to solving the problem set out by Diophantus is also discussed in full detail.     

Equivalent Sets of Solutions of the Klein–Gordon Equation with a Constant Electric Field

We argue extensively in favor of our earlier choice of the in and out states (among the solutions of a wave equation with one-dimensional potential). In this connection, we study the nonstationary and stationary families of complete sets of solutions of the Klein–Gordon equation with a constant electric field. A nonstationary set _Pv consists of the solutions with the quantum number p _v=p ⁰ v–p₃. It can be obtained from the nonstationary set _P3 with the quantum number p ₃ by a boost along the x ₃ axis (in the direction of the electric field) with the velocity –v. By changing the gauge, we can bring the solutions in all sets to the same potential without changing quantum numbers. Then the transformations of solutions in one set (with the quantum number p _v) to the solutions in another set (with the quantum number p _v) have group properties. The stationary solutions and sets have the same properties as the nonstationary ones and are obtainable from stationary solutions with the quantum number p ⁰ by the same boost. It turns out that each set can be obtained from any other by gauge manipulations. All sets are therefore equivalent, and the classification (i.e., assigning the frequency sign and the in and out indices) in any set is determined by the classification in the set _P3, where it is obvious.     

Hyperbolic boundary value problems for symmetric systems with variable multiplicities

We extend the Kreiss-Majda theory of stability of hyperbolic initial-boundary-value and shock problems to a class of systems, notably including the equations of magnetohydrodynamics (MHD), for which Majda's block structure condition does not hold: namely, simultaneously symmetrizable systems with characteristics of variable multiplicity, satisfying at points of variable multiplicity either a “totally nonglancing” or a “nonglancing and linearly splitting” condition. At the same time, we give a simple characterization of the block structure condition as “geometric regularity” of characteristics, defined as analyticity of associated eigenprojections. The totally nonglancing or nonglancing and linearly splitting conditions are generically satisfied in the simplest case of crossings of two characteristics, and likewise for our main physical examples of MHD or Maxwell equations for a crystal. Together with previous analyses of spectral stability carried out by Gardner-Kruskal and Blokhin-Trakhinin, this yields immediately a number of new results of nonlinear inviscid stability of shock waves in MHD in the cases of parallel or transverse magnetic field, and recovers the sole previous nonlinear result, obtained by Blokhin-Trakhinin by direct “dissipative integral” methods, of stability in the zero-magnetic field limit. We also discuss extensions to the viscous case.     

An outranking-based general approach to solving group multi-objective optimization problems

This paper presents a general approach to solving multi-objective programming problems with multiple decision makers. The proposal is based on optimizing a bi-objective measure of “collective satisfaction”. Group satisfaction is understood as a reasonable balance between the strengths of an agreeing and an opposing coalition, considering also the number of decision makers not belonging to any of these coalitions. Accepting the vagueness of “collective satisfaction”, even the vagueness of “person satisfaction”, fuzzy outranking relations and other fuzzy logic models are used.     

On the lifetime of a random binary sequence

Consider a system with m elements which is used to fulfill tasks. Each task is sent to one element which fulfills a task and the outcome is either fulfillment of the task (“1”) or the failure of the element (“0”). Initially, m tasks are sent to the system. At the second step, a complex of length m₁ is formed and sent to the system, where m₁ is the number of tasks fulfilled at the first step, and so on. The process continues until all elements fail and the corresponding waiting time defines the lifetime of the binary sequence which consists of “1” or “0”. We obtain a recursive equation for the expected value of this waiting time random variable.     

The height and range of watermelons without wall

We determine the weak limit of the distribution of the random variables “height” and “range” on the set of p$p$-watermelons without wall restriction as the number of steps tends to infinity. Additionally, we provide asymptotics for the moments of the random variable “height”.     

Fast solving of weighted pairing least-squares systems

This paper presents a generalization of the “weighted least-squares” (WLS), named “weighted pairing least-squares” (WPLS), which uses a rectangular weight matrix and is suitable for data alignment problems. Two fast solving methods, suitable for solving full rank systems as well as rank deficient systems, are studied. Computational experiments clearly show that the best method, in terms of speed, accuracy, and numerical stability, is based on a special {1, 2, 3}-inverse, whose computation reduces to a very simple generalization of the usual “Cholesky factorization-backward substitution” method for solving linear systems.     

Some remarks on the meaning of equality in Diophantos’s Arithmetica

Diophantos in Arithmetica, without having defined previously any concept of “equality” or “equation,” employs a concept of the unknown number as a tool for solving problems and finds its value from an equality ad hoc created. In this paper we analyze Diophantos’s practices in the creation and simplification of such equalities, aiming to adduce more evidence on certain issues arising in recent historical research on the meaning of the “equation” in Diophantos’s work.     

Lindelöf spaces which are Menger, Hurewicz, Alster, productive, or D

We discuss relationships in Lindelöf spaces among the properties “Menger”, “Hurewicz”, “Alster”, “productive”, and “D”.     

A dual simplex-based method for determination of the right and left returns to scale in DEA

This study reviews the concept of the “right” and the “left” returns to scale (RTS) in data envelopment analysis (DEA), and a dual simplex-based method, for determining these two notions in RTS, is proposed, which has computational advantages as compared to the customary method.     

On the relationship between two three-critical-point theorems

In this paper we analyze the hypotheses of two theorems which have proven to be useful tools for obtaining the existence of three critical points in nonlinear problems. In both cases the hypotheses can be stated in terms of some elementary inequalities involving “coercive” (in a suitable sense) sets of affine functions. We prove that the two resulting inequalities are in fact equivalent.     

Potential polynomials and Motzkin paths

A Motzkin path of length n is a lattice path from (0,0) to (n,0) in the plane integer lattice Z×Z consisting of horizontal-steps (1,0), up-steps (1,1), and down-steps (1,−1), which never passes below the x-axis. A u-segment (resp. h-segment) of a Motzkin path is a maximal sequence of consecutive up-steps (resp. horizontal-steps). The present paper studies two kinds of statistics on Motzkin paths: “number of u-segments” and “number of h-segments”. The Lagrange inversion formula is utilized to represent the weighted generating function for the number of Motzkin paths according to the two statistics as a sum of the partial Bell polynomials or the potential polynomials. As an application, a general framework for studying compositions are also provided.