Related papers: On $T$-avoiding spherical codes and designs in $\m…

Tensor product of irreducible modules of highest weight over a semi-simple quantum group is semi-simple if and only if a natural contravariant form is non-degenerate when restricted to the span of singular vectors. We express this…

A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…

We study rings with infinitely (only finitely) many maximal subrings. We prove that if $M$ is a maximal left/right ideal of a ring $T$ which is not an ideal of $T$, and $R$ is the idealizer of $M$, then $T$ has at least $|R/M|+1$ maximal…

We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…

In this paper, we consider the optimal disturbance rejection problem for possibly infinite dimensional linear time-varying (LTV) systems using a framework based on operator algebras of classes of bounded linear operators. This approach does…

Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projection of a vector of interest onto the subspace spanned by…

For every pattern $p$ over the alphabet $\{x,y,x^R,y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.

In this paper we describe all pairs of binary vectors $({\bf u}, {\bf v})$ such that the set of vectors obtained by $t$ deletions in ${\bf v}$ is a subset of the set of vectors obtained by $t$ deletions in ${\bf u}$ for $t=1,2$. Such pairs…

We show that birational smooth complex projective varieties with numerically effective canonical bundles along the exceptional loci have the same Betti numbers. In particular, birational smooth minimal models share the same Betti numbers.…

Let D be the support design of the minimum weight of an extremal binary doubly even self-dual [24m,12m,4m+4] code. In this note, we consider the case when D becomes a t-design with t \geq 6.

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…

We investigate sets of the common zeros of non-constant semi-invariants for regular modules over canonical algebras. In particular, we show that if the considered algebra is tame then for big enough vectors these sets are complete…

Let $T$ be the subgroup of diagonal matrices in the group SL(n). The aim of this paper is to find all finite-dimensional simple rational SL(n)-modules $V$ with the following property: for each point $v\in V$ the closure $\bar{Tv}$ of its…

We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto unknown families of simplices in quaternionic…

The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…

We define a Toledo number for actions of surface groups and complex hyperbolic lattices on infinite dimensional Hermitian symmetric spaces, which allows us to define maximal representations. When the target is not of tube type we show that…

Yudin's lower bound for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K, where K can be R, C, or H (the field of quaternions), and thus to isometric embeddings of l_2 into l_p with p an…

Proving the universal optimality of the hexagonal lattice is one of the big open challenges of nowadays mathematics. We show that the hexagonal lattice outperforms certain "natural" classes of periodic configurations. Also, we rule out the…

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…