On the orthogonality of the Chebyshev–Frolov lattice and applications

We deal with lattices that are generated by the Vandermonde matrices associated to the roots of Chebyshev polynomials. If the dimension d of the lattice is a power of two, i.e. \(d=2^m, m \in \mathbb {N}\), the resulting lattice is an admissible lattice in the sense of Skriganov. We prove that these lattices are orthogonal and possess a lattice representation matrix with orthogonal columns and entries not larger than 2 (in modulus). In particular, we clarify the existence of orthogonal admissible lattices in higher dimensions. The orthogonality property allows for an efficient enumeration of these lattices in axis parallel boxes. Hence they serve for a practical implementation of the Frolov cubature formulas, which recently drew attention due to their optimal convergence rates in a broad range of Besov–Lizorkin–Triebel spaces. As an application, we efficiently enumerate the Frolov cubature nodes in the d-cube \([-1/2,1/2]^d\) up to dimension \(d=16\).     

On the Chermak–Delgado lattice of a finite group

Abstract

By imposing conditions upon the index of a self-centralizing subgroup of a group, and upon the index of the center of the group, we are able to classify the Chermak-Delgado lattice of the group. This is our main result. We use this result to classify the Chermak-Delgado lattices of dicyclic groups and of metabelian p-groups of maximal class.     

On the Existence of Quasipattern Solutions of the Swift–Hohenberg Equation

Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving quasiperiodicity, there is a small divisor problem. In this paper, we consider 8-fold, 10-fold, 12-fold, and higher order quasipattern solutions of the Swift–Hohenberg equation. We prove that a formal solution, given by a divergent series, may be used to build a smooth quasiperiodic function which is an approximate solution of the pattern-forming partial differential equation (PDE) up to an exponentially small error.     

On the speed of convergence to stationarity of the Erlang loss system

We consider the Erlang loss system, characterized by N servers, Poisson arrivals and exponential service times, and allow the arrival rate to be a function of N. We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and display some bounds for the total variation distance between the time-dependent and stationary distributions. We also pay attention to time-dependent rates.     

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.     

On a Global Complexity Bound of the Levenberg-Marquardt Method

In this paper, we investigate a global complexity bound of the Levenberg-Marquardt method (LMM) for the nonlinear least squares problem. The global complexity bound for an iterative method solving unconstrained minimization of φ is an upper bound to the number of iterations required to get an approximate solution, such that ‖∇φ(x)‖≤ε. We show that the global complexity bound of the LMM is O(ε ⁻²).     

On the lattice structure of the set of stable matchings for a many-to-one model ∗

For the many-to-one matching model with firms having substitutable and q-separable preferences we propose two very natural binary operations that together with the unanimous partial ordering of the workers endow the set of stable matchings with a lattice structure. We also exhibit examples in which, under this restricted domain of firms' preferences, the classical binary operations may not even be matching     

On the number of divisors which are values of a polynomial

Let τ(n) be the number of positive divisors of an integer n, and for a polynomial P(X)∈ℤ[X], let

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.     

On the mathematical formulation of the problem of reassembling fragmented objects: two new theorems

In this paper two new theorems are proved in association with the problem of matching three dimensional solid bodies. Rigorous mathematical criteria are given in order to test if two such bodies actually match in a certain position. Since this problem finds important application to the actual problem of reassembling fragmented objects e.g. archaeological, special care is taken to account for small gaps between matching fragments and fuzziness of the matching parameters.     

On the Perpetual Collision-Free RHC of Fleets of Vehicles

Receding horizon control is emerging as a very promising technique for the centralized control of fleets of vehicles on land, sea, and in the air. We present a sufficient condition for collision avoidance within a fleet under receding horizon control, over an indefinite period of operation.     

On the dynamics of a finite buffer queue conditioned on the amount of loss

This paper is concerned with computing large-deviation asymptotics for the loss process in a stylized queueing model that is fed by a Brownian input process. In addition, the dynamics of the queue, conditional on such a large deviation in the loss, is calculated. Finally, the paper computes the quasi-stationary distribution of the system and the corresponding dynamics, conditional on no loss occurring.     

On the Higher-Order Method for the Solution of a Nonlinear Scalar Equation

In this paper, a higher-order method for the solution of a nonlinear scalar equation is presented. It is proved that the new method is locally convergent with an order of (m+2), where m is the highest order derivative used in the iterative formula. Some numerical examples are used to demonstrate the new method.     

On the Andrews–Schur proof of the Rogers–Ramanujan identities

In this article, we study one of Andrews’ proofs of the Rogers–Ramanujan identities published in 1970. His proof inspires connections to some famous formulas discovered by Ramanujan. During the course of study, we discovered identities such as $$\sum_{n\geq0}\frac{q^{n^2}}{(q;q)_n}=\frac{1}{\sqrt{5}}\Biggl(\beta \prod_{n=1}^{\infty}\frac{1}{1+\alpha q^{n/5}+q^{2n/5}}-\alpha \prod_{n=1}^{\infty}\frac{1}{1+\beta q^{n/5}+q^{2n/5}}\Biggr),$$ where β=?1/α is the Golden Ratio.     

On Tightness and Weak Convergence in the Approximation of the Occupation Measure of Fractional Brownian Motion

In this paper we consider approximations of the occupation measure of the Fractional Brownian motion by means of some functionals defined on regularizations of the paths. In a previous article Berzin and León proved a cylindrical convergence to a Wiener process of conveniently rescaled functionals. Here we show the tightness of the approximation in the space of continuous functions endowed with the topology of uniform convergence on compact sets. This allows us to simplify the identification of the limit.     

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.     

On the points of order 3 of the period parallelogram of the Weierstrass elliptic function

We examine the significance of the values of the Weierstrass ℘ function at the points of order three in the period parallelogram. Based upon the well-known duplication formulae and the differential equation of the Weierstrass ℘ function, we derive a set of identities involving the values of ℘ at these points.      

On Pointwise Convergence of Fourier Series of the Indicator Function of D Dimensional Ball

We prove the pointwise convergence of the Fourier series for the indicator function in d dimensional ball. The results are very different for every dimension. Our method of proof depends on the lattice points problem, especially, on the papers of Czechoslovakian mathematician Břetislav Novák.     

On Lovász’ lattice reduction and the nearest lattice point problem

Answering a question of Vera Sós, we show how Lovász’ lattice reduction can be used to find a point of a given lattice, nearest within a factor ofc ^d (c = const.) to a given point in R ^d . We prove that each of two straightforward fast heuristic procedures achieves this goal when applied to a lattice given by a Lovász-reduced basis. The verification of one of them requires proving a geometric feature of Lovász-reduced bases: ac ₁ ^d lower bound on the angle between any member of the basis and the hyperplane generated by the other members, wherec ₁ = √2/3. As an application, we obtain a solution to the nonhomogeneous simultaneous diophantine approximation problem, optimal within a factor ofC ^d . In another application, we improve the Grötschel-Lovász-Schrijver version of H. W. Lenstra’s integer linear programming algorithm. The algorithms, when applied to rational input vectors, run in polynomial time.