Related papers: A short proof that all linear codes are weakly alg…
We introduce the class of generalized biserial quiver algebras and prove that they provide a complete classification of all weakly symmetric biserial algebras over an algebraically closed field.
In this paper we study the algebraic-geometry of any one-point code on the Hermitian curve. Moreover, we characterize the minimum-weight codewords of some of their dual codes and describe many their small-weight codewords.
All candidates to the weakly-irreducible not irreducible holonomy algebras of Lorentzian manifolds are known. In the present paper metrics that realize all these candidates as holonomy algebras are given. This completes the classification…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do…
We show an analogue of a theorem of An, Ghosh, Guan, and Ly on weighted badly approximable vectors for totally imaginary number fields. We show that for $G=\mathrm{SL}_2(\mathbb{C})\times\dots\times\mathrm{SL}_2(\mathbb{C})$ and $\Gamma<G$…
Let $A=\pmb k[x_1,...,x_n]/{(x_1^d,...,x_n^d)}$, where $\pmb k$ is an infinite field. If $\pmb k$ has characteristic zero, then Stanley proved that $A$ has the Weak Lefschetz Property (WLP). Henceforth, $\pmb k$ has positive characteristic…
The purpose of this note is to give a simple proof of the following theorem: Let $X$ be a normal projective variety over an algebraically closed field $k$, $\op{char} k = 0$ and let $D \subset X$ be a proper closed subvariety of $X$. Then…
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…
According to Kirillov's theory, the construction of a unitary irreducible representation of a nilpotent Lie group requires a precise computation of some polarizing subalgebra subordinated to a linear functional in the linear dual of the…
Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…
We revisit a geometric lower bound for Waring rank of polynomials (symmetric rank of symmetric tensors) of Landsberg and Teitler and generalize it to a lower bound for rank with respect to arbitrary varieties, improving the bound given by…
Linear codes with few weights have been a significant area of research in coding theory for many years, due to their applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. Inspired by…
The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight…
We give simple and unified proofs of weak holomorhpic Morse inequalities on complete manifolds, $q$-convex manifolds, pseudoconvex domains, weakly $1$-complete manifolds and covering manifolds. This paper is essentially based on the…
In this paper, we show that a completely positive linear map is weakly nuclear if and only if its complexification is weakly nuclear. It is shown that a real $C^*$-algebra is exact if and only if its complexification is exact and similar…
We study initial cuts of models of weak two-sorted Bounded Arithmetics with respect to the strength of their theories and show that these theories are stronger than the original one. More explicitly we will see that polylogarithmic cuts of…
The aim of this note is to give an effective criterion to verify whether a cubic polynomial over a non-Archimedean field has a weak N\'{e}ron model or not.
In this paper, we give a geometric characterization of minimal linear codes. In particular, we relate minimal linear codes to cutting blocking sets, introduced in a recent paper by Bonini and Borello. Using this characterization, we derive…
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…