scholarly journals THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS

2021 ◽  
pp. 1-7
Author(s):  
PU QIAO ◽  
XINGZHI ZHAN
Keyword(s):  
Linear Algebra ◽  
Cambridge Philos ◽  
Positive Integers

Abstract A graph is called radially maximal if it is not complete and the addition of any new edge decreases its radius. Harary and Thomassen [‘Anticritical graphs’, Math. Proc. Cambridge Philos. Soc.79(1) (1976), 11–18] proved that the radius r and diameter d of any radially maximal graph satisfy $r\le d\le 2r-2.$ Dutton et al. [‘Changing and unchanging of the radius of a graph’, Linear Algebra Appl.217 (1995), 67–82] rediscovered this result with a different proof and conjectured that the converse is true, that is, if r and d are positive integers satisfying $r\le d\le 2r-2,$ then there exists a radially maximal graph with radius r and diameter $d.$ We prove this conjecture and a little more.

MORE ON A CERTAIN ARITHMETICAL DETERMINANT

2017 ◽  
Vol 97 (1) ◽  
pp. 15-25 ◽  
Author(s):  
ZONGBING LIN ◽  
SIAO HONG
Keyword(s):  
Linear Algebra ◽  
Acta Math ◽  
Arithmetical Function ◽  
Greatest Common Divisor ◽  
Multiplicative Functions ◽  
Common Multiple ◽  
Least Common Multiple ◽  
Mobius Function ◽  
Dirichlet Convolution ◽  
Positive Integers

Let $n\geq 1$ be an integer and $f$ be an arithmetical function. Let $S=\{x_{1},\ldots ,x_{n}\}$ be a set of $n$ distinct positive integers with the property that $d\in S$ if $x\in S$ and $d|x$. Then $\min (S)=1$. Let $(f(S))=(f(\gcd (x_{i},x_{j})))$ and $(f[S])=(f(\text{lcm}(x_{i},x_{j})))$ denote the $n\times n$ matrices whose $(i,j)$-entries are $f$ evaluated at the greatest common divisor of $x_{i}$ and $x_{j}$ and the least common multiple of $x_{i}$ and $x_{j}$, respectively. In 1875, Smith [‘On the value of a certain arithmetical determinant’, Proc. Lond. Math. Soc. 7 (1875–76), 208–212] showed that $\det (f(S))=\prod _{l=1}^{n}(f\ast \unicode[STIX]{x1D707})(x_{l})$, where $f\ast \unicode[STIX]{x1D707}$ is the Dirichlet convolution of $f$ and the Möbius function $\unicode[STIX]{x1D707}$. Bourque and Ligh [‘Matrices associated with classes of multiplicative functions’, Linear Algebra Appl. 216 (1995), 267–275] computed the determinant $\det (f[S])$ if $f$ is multiplicative and, Hong, Hu and Lin [‘On a certain arithmetical determinant’, Acta Math. Hungar. 150 (2016), 372–382] gave formulae for the determinants $\det (f(S\setminus \{1\}))$ and $\det (f[S\setminus \{1\}])$. In this paper, we evaluate the determinant $\det (f(S\setminus \{x_{t}\}))$ for any integer $t$ with $1\leq t\leq n$ and also the determinant $\det (f[S\setminus \{x_{t}\}])$ if $f$ is multiplicative.

Minimal interval exchange transformations with flips

2017 ◽  
Vol 38 (8) ◽  
pp. 3101-3144 ◽  
Author(s):  
ANTONIO LINERO BAS ◽  
GABRIEL SOLER LÓPEZ
Keyword(s):  
Linear Algebra ◽  
Geometric Approach ◽  
Interval Exchange ◽  
Positive Power ◽  
Direct Construction ◽  
Interval Exchange Transformations ◽  
Associated Matrix ◽  
Rauzy Induction ◽  
Positive Integers ◽  
Uniquely Ergodic

We consider interval exchange transformations of$n$intervals with$k$flips, or$(n,k)$-IETs for short, for positive integers$k,n$with$k\leq n$. Our main result establishes the existence of minimal uniquely ergodic$(n,k)$-IETs when$n\geq 4$; moreover, these IETs are self-induced for$2\leq k\leq n-1$. This result extends the work on transitivity in Gutierrezet al[Transitive circle exchange transformations with flips.Discrete Contin. Dyn. Syst. 26(1) (2010), 251–263]. In order to achieve our objective we make a direct construction; in particular, we use the Rauzy induction to build a periodic Rauzy graph whose associated matrix has a positive power. Then we use a result in the Perron–Frobenius theory [Pullman, A geometric approach to the theory of non-negative matrices.Linear Algebra Appl. 4(1971) 297–312] which allows us to ensure the existence of these minimal self-induced and uniquely ergodic$(n,k)$-IETs,$2\leq k\leq n-1$. We then find other permutations in the same Rauzy class generating minimal uniquely ergodic$(n,1)$- and$(n,n)$-IETs.

scholarly journals Statistics for 3-letter patterns with repetitions in compositions

2016 ◽  
Vol Vol. 17 no. 3 (Combinatorics) ◽  
Author(s):  
Armend Shabani ◽  
Rexhep Gjergji
Keyword(s):  
Positive Integer ◽  
Linear Algebra ◽  
Generating Functions ◽  
International Audience ◽  
Positive Integers

International audience A composition $\pi = \pi_1 \pi_2 \cdots \pi_m$ of a positive integer $n$ is an ordered collection of one or more positive integers whose sum is $n$. The number of summands, namely $m$, is called the number of parts of $\pi$. Using linear algebra, we determine formulas for generating functions that count compositions of $n$ with $m$ parts, according to the number of occurrences of the subword pattern $\tau$, and according to the sum, over all occurrences of $\tau$, of the first integers in their respective occurrences, where $\tau$ is any pattern of length three with exactly 2 distinct letters.

scholarly journals On the little secondary Bruhat order

2021 ◽  
Vol 37 (37) ◽  
pp. 113-126
Author(s):  
Rosário Fernandes ◽  
Henrique F. Da Cruz ◽  
Domingos Salomão
Keyword(s):  
Partial Order ◽  
Linear Algebra ◽  
Order Relation ◽  
Bruhat Order ◽  
Symmetric Matrices ◽  
Partial Order Relation ◽  
Minimal Elements ◽  
Cover Relation ◽  
Positive Integers ◽  
Sum Vector

Let $R$ and $S$ be two sequences of positive integers in nonincreasing order having the same sum. We denote by ${\cal A}(R,S)$ the class of all $(0,1)$-matrices having row sum vector $R$ and column sum vector $S$. Brualdi and Deaett (More on the Bruhat order for $(0,1)$-matrices, Linear Algebra Appl., 421:219--232, 2007) suggested the study of the secondary Bruhat order on ${\cal A}(R,S)$ but with some constraints. In this paper, we study the cover relation and the minimal elements for this partial order relation, which we call the little secondary Bruhat order, on certain classes ${\cal A}(R,S)$. Moreover, we show that this order is different from the Bruhat order and the secondary Bruhat order. We also study a variant of this order on certain classes of symmetric matrices of ${\cal A}(R,S)$.

Matrix Completions, Moments, and Sums of Hermitian Squares

2011 ◽  
Author(s):  
Mihály Bakonyi ◽  
Hugo J. Woerdeman
Keyword(s):  
Linear Algebra ◽  
Undergraduate Students ◽  
Complex Analysis ◽  
Measure Theory ◽  
Complex Function ◽  
Complex Function Theory ◽  
Extensive Discussion ◽  
The Subject ◽  
Processing Control ◽  
Developing Area

Intensive research in matrix completions, moments, and sums of Hermitian squares has yielded a multitude of results in recent decades. This book provides a comprehensive account of this quickly developing area of mathematics and applications and gives complete proofs of many recently solved problems. With MATLAB codes and more than two hundred exercises, the book is ideal for a special topics course for graduate or advanced undergraduate students in mathematics or engineering, and will also be a valuable resource for researchers. Often driven by questions from signal processing, control theory, and quantum information, the subject of this book has inspired mathematicians from many subdisciplines, including linear algebra, operator theory, measure theory, and complex function theory. In turn, the applications are being pursued by researchers in areas such as electrical engineering, computer science, and physics. The book is self-contained, has many examples, and for the most part requires only a basic background in undergraduate mathematics, primarily linear algebra and some complex analysis. The book also includes an extensive discussion of the literature, with close to six hundred references from books and journals from a wide variety of disciplines.

Topics in Quaternion Linear Algebra

2014 ◽  
Author(s):  
Leiba Rodman
Keyword(s):  
Linear Algebra ◽  
Complex Analysis ◽  
Dimensional Space ◽  
Applied Mathematics ◽  
Three Dimensional ◽  
Number System ◽  
Graduate Course ◽  
Open Problems ◽  
Unpublished Research ◽  
Reference Tool

Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses or as a basis for a graduate course in linear algebra. The open problems can serve as research projects for undergraduates, topics for graduate students, or problems to be tackled by professional research mathematicians. The book is also an invaluable reference tool for researchers in fields where techniques based on quaternion analysis are used.

Sign in / Sign up

Export Citation Format

Share Document