Combinatorics | Design of experiments | Latin squares | Combinatorial design
In mathematics, an orthogonal array is a "table" (array) whose entries come from a fixed finite set of symbols (typically, {1,2,...,n}), arranged in such a way that there is an integer t so that for every selection of t columns of the table, all ordered t-tuples of the symbols, formed by taking the entries in each row restricted to these columns, appear the same number of times. The number t is called the strength of the orthogonal array. Here is a simple example of an orthogonal array with symbol set {1,2} and strength 2: Notice that the four ordered pairs (2-tuples) formed by the rows restricted to the first and third columns, namely (1,1), (2,1), (1,2) and (2,2), are all the possible ordered pairs of the two element set and each appears exactly once. The second and third columns would give, (1,1), (2,1), (2,2) and (1,2); again, all possible ordered pairs each appearing once. The same statement would hold had the first and second columns been used. This is thus an orthogonal array of strength two. Orthogonal arrays generalize, in a tabular form, the idea of mutually orthogonal Latin squares. These arrays have many connections to other combinatorial designs and have applications in the statistical design of experiments, coding theory, cryptography and various types of software testing. (Wikipedia).
11J Orthogonal Projection of a Vector
The orthogonal projection of one vector along another.
From playlist Linear Algebra
11H Orthogonal Projection of a Vector
The orthogonal projection of one vector along another.
From playlist Linear Algebra
11I Orthogonal Projection of a Vector
The Orthogonal Projection of one vector along another.
From playlist Linear Algebra
Linear Algebra 7.1 Orthogonal Matrices
My notes are available at http://asherbroberts.com/ (so you can write along with me). Elementary Linear Algebra: Applications Version 12th Edition by Howard Anton, Chris Rorres, and Anton Kaul A. Roberts is supported in part by the grants NSF CAREER 1653602 and NSF DMS 2153803.
From playlist Linear Algebra
This video introduces the concept of phased arrays. An array refers to multiple sensors, arranged in some configuration, that act together to produce a desired sensor pattern. With a phased array, we can electronically steer that pattern without having to physically move the array simply b
From playlist Understanding Phased Array Systems and Beamforming
This is the first video of a linear algebra-series on orthogonality. In this video, I define the notion of orthogonal sets, then show that an orthogonal set without the 0 vector is linearly independent, and finally I show that it's easy to calculate the coordinates of a vector in terms of
From playlist Orthogonality
Orthogonal matrices | Lecture 7 | Matrix Algebra for Engineers
Definition of orthogonal matrices. Join me on Coursera: https://www.coursera.org/learn/matrix-algebra-engineers Lecture notes at http://www.math.ust.hk/~machas/matrix-algebra-for-engineers.pdf Subscribe to my channel: http://www.youtube.com/user/jchasnov?sub_confirmation=1
From playlist Matrix Algebra for Engineers
In this video, I define the concept of orthogonal projection of a vector on a line (and on more general subspaces), derive a very nice formula for it, and show why orthogonal projections are so useful. You might even see the hugging formula again. Enjoy! This is the second part of the ort
From playlist Orthogonality
Measuring non-exponential decay at the bound state in continuum by Savannah Garmon
Non-Hermitian Physics - PHHQP XVIII DATE: 04 June 2018 to 13 June 2018 VENUE:Ramanujan Lecture Hall, ICTS Bangalore Non-Hermitian Physics-"Pseudo-Hermitian Hamiltonians in Quantum Physics (PHHQP) XVIII" is the 18th meeting in the series that is being held over the years in Quantum Phys
From playlist Non-Hermitian Physics - PHHQP XVIII
36 entangled officers of Euler: A quantum solution to a classically... by Arul Lakshminarayan
Colloquium: 36 entangled officers of Euler: A quantum solution to a classically impossible problem Speaker: Arul Lakshminarayan (IIT Madras, Chennai) Date: Mon, 06 June 2022, 15:30 to 17:00 Venue: Online and Madhava Lecture Hall Abstract The 36 officers problem of Euler is a well-known i
From playlist ICTS Colloquia
Dipendra Prasad - Branching laws: homological aspects
By this time in the summer school, the audience will have seen the question about decomposing a representation of a group when restricted to a subgroup which is referred to as the branching law. In this lecture, we focus attention on homological aspects of the branching law. The lecture
From playlist 2022 Summer School on the Langlands program
AGACSE2021 Joan Lasenby - GA approach to orthogonal transformations in signal and image processing.
Professor Joan Lasenby from Cambridge University on a Geometric Algebra approach to orthogonal transformations and their use in signal and image processing.
From playlist AGACSE2021
60 years of dynamics and number expansions - 11 December 2018
http://crm.sns.it/event/441/ 60 years of dynamics and number expansions Partially supported by Delft University of Technology, by Utrecht University and the University of Pisa It has been a little over sixty years since A. Renyi published his famous article on the dynamics of number expa
From playlist Centro di Ricerca Matematica Ennio De Giorgi
Ye Ke (7/29/22): Geometry of convergence analysis for low rank partially orthogonal tensor approx.
Abstract: Low rank partially orthogonal tensor approximation (LRPOTA) is an important problem in tensor computations and their applications (PCA, ICA, signal processing, data mining, latent variable model, dictionary learning, etc.). It includes Low rank orthogonal tensor approximation (LR
From playlist Applied Geometry for Data Sciences 2022
Part III: Linear Algebra, Lec 7: Dot Products
Part III: Linear Algebra, Lecture 7: Dot Products Instructor: Herbert Gross View the complete course: http://ocw.mit.edu/RES18-008F11 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT Calculus Revisited: Calculus of Complex Variables
F. Polizzi - Classification of surfaces via Mori theory (Part 4)
Abstract - We give a summary of the Minimal Model Program (namely, Mori Theory) in the case of surfaces.
From playlist Ecole d'été 2019 - Foliations and algebraic geometry
Rainbow structures, Latin squares & graph decompositions - Benny Sudakov
Computer Science/Discrete Mathematics Seminar I Topic: Rainbow structures, Latin squares & graph decompositions Speaker: Benny Sudakov Affiliation: ETH Zürich Date: March 01, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
AMMI Course "Geometric Deep Learning" - Lecture 10 (Gauges) - Taco Cohen
Video recording of the course "Geometric Deep Learning" taught in the African Master in Machine Intelligence in July-August 2021 by Michael Bronstein (Imperial College/Twitter), Joan Bruna (NYU), Taco Cohen (Qualcomm), and Petar Veličković (DeepMind) Lecture 10: Gauges • Gauge transformat
From playlist AMMI Geometric Deep Learning Course - First Edition (2021)