Related papers: Orthomartingale-coboundary decomposition for stati…
The trigonometric six-vertex model with domain wall boundary conditions and one partially reflecting end on a lattice of size $2n\times m$, $m\leq n$, is considered. The partition function is computed using the Izergin-Korepin method,…
Derivation of the lattice Boltzmann method from the continuous kinetic theory [X. He and L. S. Luo, {\it Phys. Rev. E} {\bf 55}, R6333 (1997); X. Shan and X. He, {\it Phys. Rev. Lett.} {\bf 80}, 65 (1998)] is extended in order to obtain…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
We propose a superfast method for constructing orthogonal matrices $M\in\mathcal{O}(n,q)$ in finite fields $GF(q)$. It can be used to construct $n\times n$ orthogonal matrices in $Z_p$ with very high values of $n$ and $p$, and also…
In this paper we give a general upper bound for the irrationality exponent of algebraic Laurent series with coefficients in a finite field. Our proof is based on a method introduced in a different framework by Adamczewski and Cassaigne. It…
A multivariate, stationary time series is said to be jointly regularly varying if all its finite-dimensional distributions are multivariate regularly varying. This property is shown to be equivalent to weak convergence of the conditional…
In our previous article [4] an approach to derive Papapetrou equations for constrained electromagnetic field was demonstrated by use of field variational principles. The aim of current work is to present more universal technique of…
We characterize the event of convergence of a local supermartingale. Conditions are given in terms of its predictable characteristics and quadratic variation. The notion of stationarily local integrability plays a key role.
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
In this paper, we consider the model reduction problem of large-scale systems, such as systems obtained through the discretization of partial differential equations. We propose a computationally optimal randomized proper orthogonal…
Inhomogeneous essential boundary conditions can be appended to a well-posed PDE to lead to a combined variational formulation. The domain of the corresponding operator is a Sobolev space on the domain $\Omega$ on which the PDE is posed,…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
In this paper we consider second-order field theories in a variational setting. From the variational principle the Euler-Lagrange equations follow in an unambiguous way, but it is well known that this is not true for the Cartan form. This…
We obtain improved local well-posedness results for the Lorentzian timelike minimal surface equation. In dimension $d=3$, for a surface of arbitrary co-dimension, we show a gain of $1/3$ derivative regularity compared to a generic equation…
We consider random fields defined by finite-region conditional probabilities depending on a neighborhood of the region which changes with the boundary conditions. To predict the symbols within any finite region it is necessary to inspect a…
A way to identify the would-be zero-modes of staggered lattice fermions away from the continuum limit is presented. Our approach also identifies the chiralities of these modes, and their index is seen to be determined by gauge field…
The field of algorithmic randomness studies what it means for infinite binary sequences to be random for some given uncertainty model. Classically, martingale-theoretic notions of such randomness involve precise uncertainty models, and it…
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
Using a hierarchical construction, we develop methods for a wide and flexible class of models by taking a fully parametric approach to generalized linear mixed models with complex covariance dependence. The Laplace approximation is used to…