Related papers: Angle Between Two Vectors over Finite Fields and a…

This work concerns some issues about the interplay of standard and geometric (Hamiltonian) approaches to finite-dimensional quantum mechanics, formulated in the projective space. Our analysis relies upon the notion and the properties of…

Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…

Projective Reed-Muller codes(PRM codes) are constructed from the family of projective hypersurfaces of a fixed degree over a finite field $\F_q$. In this paper, we completely determine the minimal distance of the hull of any Projective…

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…

We propose a decoding algorithm for the $(u\mid u+v)$-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one…

Based on twin representations of division ring in an Abelian group I consider $D$\Hyph vector spaces over division ring. Morphism of $D$\Hyph vector spaces is linear map of $D$\Hyph vector spaces. I consider derivative of function $f$ of…

Let $\mathbb F$ be a finite field and let $\mathcal A$ and $\mathcal B$ be vector spaces of $\mathbb F$-valued continuous functions defined on locally compact spaces $X$ and $Y$, respectively. We look at the representation of linear…

We survey recent contributions to finite element exterior calculus on manifolds and surfaces within a comprehensive formalism for the error analysis of vector-valued partial differential equations on manifolds. Our primary focus is on…

For a matrix $W \in \mathbb{Z}^{m \times n}$, $m \leq n$, and a convex function $g: \mathbb{R}^m \rightarrow \mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\{0,1\}^n$. We will study separable convex functions and…

We construct a family of measures for random fields based on the iterated subdivision of simple geometric shapes (triangles, squares, tetrahedrons) into a finite number of similar shapes. The intent is to construct continuum limits of scale…

The Hamming graph $H(n,q)$ is defined on the vertex set $\{1,2,\ldots,q\}^n$ and two vertices are adjacent if and only if they differ in precisely one coordinate. Alon (1992) proved that for any sequence $v_1,\ldots,v_b$ of $b=\lceil\frac…

In this article, we will introduce methods of non-standard analysis into projective geometry. Especially, we will analyze the properties of a projective space over a non-Archimedean field. Non-Archimedean fields contain numbers that are…

We show that in one dimension the transfer matrix M of any scattering potential v coincides with the S-matrix of an associated time-dependent non-Hermitian 2 x 2 matrix Hamiltonian H(\tau). If v is real-valued, H(\tau) is pseudo-Hermitian…

We consider a class of weighted harmonic functions in the open upper half-plane known as $\alpha$-harmonic functions. Of particular interest is the uniqueness problem for such functions subject to a vanishing Dirichlet boundary value on the…

We prove that admissible functions for Fubini-Study metrics on the complex projective space $P_{m}C$, of complex dimension $m$, invariant by a convenient automorphisms group, are lower bounded by a function going to minus infinity on the…

In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

We analyze the convergence rate of the alternating direction method of multipliers (ADMM) for minimizing the sum of two or more nonsmooth convex separable functions subject to linear constraints. Previous analysis of the ADMM typically…

Let $K$ be an infinite field and let $m_1,\ldots,m_n$ be a generalized arithmetic sequence of positive integers, i.e., there exist $h, d, m_1 \in\mathbb{Z}^+$ such that $m_i = h m_1 + (i-1)d$ for all $i \in \{2,\ldots,n\}$. We consider the…

We show that absolutely minimizing functions relative to a convex Hamiltonian $H:\mathbb{R}^n \to \mathbb{R}$ are uniquely determined by their boundary values under minimal assumptions on $H.$ Along the way, we extend the known equivalences…