Harder–Narasimhan theory for linear codes (with an appendix on Riemann–Roch theory)

In this text we develop some aspects of Harder–Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder–Narasimhan structure associated to a Galois connection between two lattices. It applies, in particular, to matroids.We then specialize this to linear codes. This could be done from at least three different approaches: using the sphere-packing analogy, or the geometric view, or the Galois connection construction just introduced. A remarkable fact is that these all lead to the same notion of semistability and canonical filtration. Relations to previous propositions toward a classification of codes, and to Wei's generalized Hamming weight hierarchy, are also discussed.Last, we study the two important questions of the preservation of semistability (or more generally the behavior of slopes) under duality, and under tensor product. The former essentially follows from Wei's duality theorem for higher weights—and its matroid version—which we revisit in an appendix, developing analogues of the Riemann–Roch, Serre duality, Clifford, and gap and gonality sequence theorems. Likewise the latter is closely related to the bound on higher weights of a tensor product, conjectured by Wei and Yang, and proved by Schaathun in the geometric language, which we reformulate directly in terms of codes. From this material we then derive semistability of tensor product.     

Optimality theory for semi-infinite linear programming ∗

This paper presents an exhaustive approach to optimality theory in semi-infinite linear programming, placing a special emphasis on generality. After surveying optimality conditions for general problems, a detailed analysis is made of problems in which the coefficients are continuous functions of a parameter which varies on a compact set, adopting a feasible directions approach. Lastly, the case of analytical coefficients over an interval is considered in some detail.     

On parabolic Kazhdan–Lusztig R-polynomials for the symmetric group

Parabolic R-polynomials were introduced by Deodhar as parabolic analogues of ordinary R-polynomials defined by Kazhdan and Lusztig. In this paper, we are concerned with the computation of parabolic R-polynomials for the symmetric group. Let $S_n$ be the symmetric group on $\{1,2,\dots ,n\}$, and let $S=\{s_i|1\le i\le n?1\}$ be the generating set of $S_n$, where for $1\le i\le n?1$, $s_i$ is the adjacent transposition. For a subset $J?S$, let ${(S_n)}_J$ be the parabolic subgroup generated by J, and let ${(S_n)}^J$ be the set of minimal coset representatives for $S_n/{(S_n)}_J$. For $u\le v\in {(S_n)}^J$ in the Bruhat order and $x\in \{q,?1\}$, let $R_{u,v}^{J,x}(q)$ denote the parabolic R-polynomial indexed by u and v. Brenti found a formula for $R_{u,v}^{J,x}(q)$ when $J=S?\{s_i\}$, and obtained an expression for $R_{u,v}^{J,x}(q)$ when $J=S?\{s_{i?1},s_i\}$. In this paper, we provide a formula for $R_{u,v}^{J,x}(q)$, where $J=S?\{s_{i?2},s_{i?1},s_i\}$ and i appears after $i?1$ in v. It should be noted that the condition that i appears after $i?1$ in v is equivalent to that v is a permutation in ${(S_n)}^{S?\{s_{i?2},s_i\}}$. We also pose a conjecture for $R_{u,v}^{J,x}(q)$, where $J=S?\{s_k,s_{k+1},\dots ,s_i\}$ with $1\le k\le i\le n?1$ and v is a permutation in ${(S_n)}^{S?\{s_k,s_i\}}$.     

Asymptotic theory for the empirical Haezendonck–Goovaerts risk measure

Haezendonck–Goovaerts risk measures is a recently introduced class of risk measures which includes, as its minimal member, the Tail Value-at-Risk (T-VaR)—T-VaR arguably the most popular risk measure in global insurance regulation. In applications often one has to estimate the risk measure given a random sample from an unknown distribution. The distribution could either be truly unknown or could be the distribution of a complex function of economic and idiosyncratic variables with the complexity of the function rendering indeterminable its distribution. Hence statistical procedures for the estimation of Haezendonck–Goovaerts risk measures are a key requirement for their use in practice. A natural estimator of the Haezendonck–Goovaerts risk measure is the Haezendonck–Goovaerts risk measure of the empirical distribution, but its statistical properties have not yet been explored in detail. The main goal of this article is to both establish the strong consistency of this estimator and to derive weak convergence limits for this estimator. We also conduct a simulation study to lend insight into the sample sizes required for these asymptotic limits to take hold.     

Weyl–Titchmarsh theory for discrete symplectic systems with general linear dependence on spectral parameter

In this paper we develop the Weyl–Titchmarsh theory for discrete symplectic systems with general linear dependence on the spectral parameter. We generalize and complete several recent results concerning these systems, which have the spectral parameter only in the second equation. Our new theory includes characterizations of the Weyl discs and Weyl circles, their limiting behaviour, properties of square summable solutions including the analysis of the exact number of linearly independent square summable solutions and limit point/circle criteria. Some illustrative examples are also provided.     

A Sinc–Collocation method for the linear Fredholm integro-differential equations

A Sinc–Collocation method for solving linear integro-differential equations of the Fredholm type is discussed. The integro-differential equations are reduced to a system of algebraic equations and Q-R method is used to establish numerical procedures. The convergence rate of the method is . Numerical results are included to confirm the efficiency and accuracy of the method even in the presence of singularities and a comparison with the rationalized Haar wavelet method is made.     

Lévy–Khinchin formula for the infinite symmetric group

Let ${\mathfrak{S}(\infty)}$ be the infinite symmetric group, inductive limit of the increasing sequence of the symmetric groups ${\mathfrak{S}(n)}$ . We establish an integral representation for the central functions of negative type on ${\mathfrak{S}(\infty)}$ , i.e. a Lévy–Khinchin formula, by following a method introduced by Berg, Christensen and Ressel (Harmonic Analysis on Semigroups. Theory of Positive Definite and Related Functions. Springer, Berlin, 1984).     

Ax–Schanuel for linear differential equations

We generalise the exponential Ax–Schanuel theorem to arbitrary linear differential equations with constant coefficients. Using the analysis of the exponential differential equation by Kirby (The theory of exponential differential equations, 2006, Sel Math 15(3):445–486, 2009) and Crampin (Reducts of differentially closed fields to fields with a relation for exponentiation, 2006) we give a complete axiomatisation of the first order theories of linear differential equations and show that the generalised Ax–Schanuel inequalities are adequate for them.     

Gröbner–Shirshov basis for the Braid group in the Birman–Ko–Lee generators

In this paper, we obtain Gröbner–Shirshov (non-commutative Gröbner) bases for braid groups in the Birman–Ko–Lee generators enriched by “Garside word” δ [J. Birman, K.H. Ko, S.J. Lee, A new approach to the word and conjugacy problems for the braid groups, Adv. Math. 139 (1998) 322–353]. It gives a new algorithm for getting the Birman–Ko–Lee normal forms in braid groups, and thus a new algorithm for solving the word problem in these groups.     

The lower estimate for the linear combinations of Bernstein–Kantorovich operators

In this paper we obtain a new strong type of Steckin inequality for the linear combinations of Bernstein–Kantorovich operators, which gives the optimal approximation rate. On the basis of this inequality, we further obtain the lower estimate for these operators.     

A smoothing Levenberg–Marquardt method for the extended linear complementarity problem

We consider the extended linear complementarity problem (XLCP), of which the linear and horizontal linear complementarity problems are two special cases. We reformulate the XLCP to a smooth equation by using some smoothing functions and propose a Levenberg–Marquardt method to solve the system of smooth equation. The global convergence and local superlinear convergence rate are established under certain conditions. Numerical tests show the effectiveness of the proposed algorithm.     

Continuous piecewise linear finite elements for the Kirchhoff–Love plate equation

A family of continuous piecewise linear finite elements for thin plate problems is presented. We use standard linear interpolation of the deflection field to reconstruct a discontinuous piecewise quadratic deflection field. This allows us to use discontinuous Galerkin methods for the Kirchhoff–Love plate equation. Three example reconstructions of quadratic functions from linear interpolation triangles are presented: a reconstruction using Morley basis functions, a fully quadratic reconstruction, and a more general least squares approach to a fully quadratic reconstruction. The Morley reconstruction is shown to be equivalent to the basic plate triangle (BPT). Given a condition on the reconstruction operator, a priori error estimates are proved in energy norm and L ² norm. Numerical results indicate that the Morley reconstruction/BPT does not converge on unstructured meshes while the fully quadratic reconstruction show optimal convergence.     

Energy decay for the linear Klein–Gordon equation and boundary control

In this work we study the asymptotic behavior of the solutions of the linear Klein–Gordon equation in R^N${\mathbb{R}}^N$, N?1$N?1$. We prove that local energy of solutions to the Cauchy problem decays polynomially. Afterwards, we use the local decay of energy to study exact boundary controllability for the linear Klein–Gordon equation in general bounded domains of R^N${\mathbb{R}}^N$, N?1$N?1$.     

Renormalization scenario for the quantum Yang–Mills theory in four-dimensional space–time

We consider the renormalization of the Yang–Mills theory in four-dimensional space–time using the background-field formalism.