Related papers: On $T$-avoiding spherical codes and designs in $\m…
In a previous study, we presented a construction of spherical 3-designs. In the current study, using this construction, we present new optimal antipodal spherical codes in the space of spherical harmonics. Our construction is a…
This work concerns surjective maps $\varphi\colon R\to S$ of commutative noetherian local rings with kernel generated by a regular sequence that is part of a minimal generating set for the maximal ideal of $R$. The main result provides…
Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of…
While planar Fermi superfluids form Abrikosov vortex lattices under magnetic or effective gauge fields, spherical geometry forbids perfect lattices above 20 vortices. We characterize approximate vortex structures of atomic Fermi superfluids…
We introduce the notion of a conformal design based on a vertex operator algebra. This notation is a natural analog of the notion of block designs or spherical designs when the elements of the design are based on self-orthogonal binary…
This paper shows that for the domain intersection $\dom T\cap\dom T^*$ of a closed linear operator and its Hilbert space adjoint everything is possible for very common classes of operators with non-empty resolvent set. Apart from the most…
This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…
We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in the…
To follow up on the results of [1], we propose a computationally efficient explicit cyclic decomposition of the maximal tori in the groups $SL_n(q)$ and $SU_n(q)$ and their projective images. We also derive some corollaries to simplify…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
We consider the problem of geometric optimisation of the lowest eigenvalue of the Laplacian in the exterior of a compact planar set, subject to attractive Robin boundary conditions. Under either a constraint of fixed perimeter or area, we…
Koutras has proposed some methods to construct reducible proper conformal Killing tensors and Killing tensors (which are, in general, irreducible) when a pair of orthogonal conformal Killing vectors exist in a given space. We give the…
This paper introduces a new class of error-correcting codes constructed from the ideal lattices of finite commutative ternary Gamma-semirings (TGS). Unlike classical linear or ring-linear codes, which rely on binary operations, TGS codes…
A high number of discrete optimization problems, including Vertex Cover, Set Cover or Feedback Vertex Set, can be unified into the class of covering problems. Several of them were shown to be inapproximable by deterministic algorithms. This…
Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. We exhibit slices of the representation theory of $\Lambda$ that are always classifiable in stringent geometric terms. Namely, we prove that, for any…
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…
Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of…
Blocking sets and minimal codes have been studied for many years in projective geometry and coding theory. In this paper, we provide a new lower bound on the size of $t$-fold $s$-blocking sets without the condition $t \leq q$, which is…
This paper presents a method to build explicit tensor-train (TT) representations. We show that a wide class of tensors can be explicitly represented with sparse TT-cores, obtaining, in many cases, optimal TT-ranks. Numerical experiments…