SearcharxivSearch

arXiv · math/0508260

Introduction to Linear Bialgebra

Abstract

The algebraic structure, linear algebra happens to be one of the subjects which yields itself to applications to several fields like coding or communication theory, Markov chains, representation of groups and graphs, Leontief economic models and so on. This book has for the first time, introduced a new algebraic structure called linear bialgebra, which is also a very powerful algebraic tool that can yield itself to applications. With the recent introduction of bimatrices (2005)we have ventured in this book to introduce new concepts like linear bialgebra and Smarandache neutrosophic linear bialgebra and also give the applications of these algebraic structures. It is important to mention here it is a matter of simple exercise to extend these to linear n-algebra for any n greater than 2; for n = 2 we get the linear bialgebra. This book has five chapters. In the first chapter we just introduce some basic notions of linear algebra and Slinear algebra and their applications. Chapter two introduces some new algebraic bistructures. In chapter three we introduce the notion of linear bialgebra and discuss several interesting properties about them. Also, application of linear bialgebra to bicodes is given. A remarkable part of our research in this book is the introduction of the notion of birepresentation of bigroups. The fourth chapter introduces several neutrosophic algebraic structures since they help in defining the new concept of neutrosophic linear bialgebra, neutrosophic bivector spaces, Smarandache neutrosophic linear bialgebra and Smarandache neutrosophic bivector spaces. Theirprobable applications to real-world models are discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

W. B. Vasantha Kandasamy, Florentin Smarandache, K. Ilanthenral. 2005-08-15. Introduction to Linear Bialgebra. https://arxiv.org/abs/math/0508260

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM