Related papers: On the unitarization of linear representations of …
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
We first prove some weighted inequalities for compositions of functions on time scales which are in turn applied to establish some new dynamic Opial-type inequalities in several variables. Some generalizations and applications to partial…
In this paper, we find a criterium for universal equivalence of partially commutative Lie algebras whose defining graphs are trees. Besides, we obtain bases for partially commutative metabelian Lie algebras.
We give the classification of the positive energy (lowest weight) unitary irreducible representations of the superalgebras osp(1|2n,R).
Unitary vertex operator algebras are introduced and studied. It is proved that most well-known rational vertex operator algebras are unitary. The classification of unitary vertex operator algebras with central charge c less than or equal to…
We study first order linear partial differential equations that appear, for example, in the analysis of dimishing urn models with the help of the method of characteristics and formulate sufficient conditions for a central limit theorem.
In this paper, we extend the notion of orthogonality to the general elements of an absolute matrix order unit space and relate it to the orthogonality among positive elements. We introduce the notion of a partial isometry in an absolute…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
Monotonic semantic path orders and weighted path orders are powerful reduction orders for proving termination of term rewrite systems. In this paper we present their simple unification as reduction orders and reduction pairs. We also…
Motivated by the orthogonality relations for irreducible characters of a finite group, we evaluate the sum of a finite group of linear characters of a Hopf algebra, at all grouplike and skew-primitive elements. We then discuss results for…
A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.
This paper completes a series devoted to explicit constructions of finite-dimensional irreducible representations of the classical Lie algebras. Here the case of odd orthogonal Lie algebras (of type B) is considered (two previous papers…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…
We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…
We classify all linearly compact simple Jordan superalgebras over an algebraically closed field of characteristic zero. As a corollary, we deduce the classification of all linearly compact unital simple generalized Poisson superalgebras.
The aim of this work is to algebraically describe the relative generalized Hamming weights of evaluation codes. We give a lower bound for these weights in terms of a footprint bound. We prove that this bound can be sharp. We compute the…
In this paper, the complete description of centralizers of elements in partially commutative Lie algebras is obtained. The description is given explicitly in the terms of generators.
These lecture notes provide a unified overview of most known canonical desingularization methods in characteristic zero. It starts with discussing the classical method, and then proceeds with the recently discovered ones: logarithmic…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…