## Table of Contents

81 relations: Adjacency matrix, Algebraic logic, Analysis of variance, Binary relation, Bipartite graph, Bit array, Block design, Boolean algebra, Boolean domain, Boolean satisfiability problem, Bulletin of the American Mathematical Society, Cambridge University Press, Canadian Journal of Mathematics, Cardinality, Category (mathematics), Combinatorics, Composition of relations, Costas array, D. R. Fulkerson, De Bruijn torus, Design matrix, Directed graph, Disjunct matrix, Divisor, Equality (mathematics), Expected value, Finite field, Finite geometry, Finite set, Gale–Ryser theorem, Go (game), Graph (discrete mathematics), Graph theory, Groupoid, H. J. Ryser, Homogeneous relation, Idempotence, Identity matrix, Incidence geometry, Incidence matrix, Incidence structure, Inclusion (logic), Indexed family, Information and Computation, Integer, Irving Copi, Journal of Symbolic Logic, L. R. Ford Jr., Lattice (order), List of named matrices, ... Expand index (31 more) »

## Adjacency matrix

In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. Logical matrix and adjacency matrix are matrices.

See Logical matrix and Adjacency matrix

## Algebraic logic

In mathematical logic, algebraic logic is the reasoning obtained by manipulating equations with free variables.

See Logical matrix and Algebraic logic

## Analysis of variance

Analysis of variance (ANOVA) is a collection of statistical models and their associated estimation procedures (such as the "variation" among and between groups) used to analyze the differences among means.

See Logical matrix and Analysis of variance

## Binary relation

In mathematics, a binary relation associates elements of one set, called the domain, with elements of another set, called the codomain.

See Logical matrix and Binary relation

## Bipartite graph

In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is, every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph.

See Logical matrix and Bipartite graph

## Bit array

A bit array (also known as bitmask, bit map, bit set, bit string, or bit vector) is an array data structure that compactly stores bits.

See Logical matrix and Bit array

## Block design

In combinatorial mathematics, a block design is an incidence structure consisting of a set together with a family of subsets known as blocks, chosen such that frequency of the elements satisfies certain conditions making the collection of blocks exhibit symmetry (balance).

See Logical matrix and Block design

## Boolean algebra

In mathematics and mathematical logic, Boolean algebra is a branch of algebra.

See Logical matrix and Boolean algebra

## Boolean domain

In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true. Logical matrix and Boolean domain are Boolean algebra.

See Logical matrix and Boolean domain

## Boolean satisfiability problem

In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. Logical matrix and Boolean satisfiability problem are Boolean algebra.

See Logical matrix and Boolean satisfiability problem

## Bulletin of the American Mathematical Society

The Bulletin of the American Mathematical Society is a quarterly mathematical journal published by the American Mathematical Society.

See Logical matrix and Bulletin of the American Mathematical Society

## Cambridge University Press

Cambridge University Press is the university press of the University of Cambridge.

See Logical matrix and Cambridge University Press

## Canadian Journal of Mathematics

The Canadian Journal of Mathematics (Journal canadien de mathématiques) is a bimonthly mathematics journal published by the Canadian Mathematical Society.

See Logical matrix and Canadian Journal of Mathematics

## Cardinality

In mathematics, the cardinality of a set is a measure of the number of elements of the set.

See Logical matrix and Cardinality

## Category (mathematics)

In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of "objects" that are linked by "arrows".

See Logical matrix and Category (mathematics)

## Combinatorics

Combinatorics is an area of mathematics primarily concerned with the counting, selecting and arranging of objects, both as a means and as an end in itself.

See Logical matrix and Combinatorics

## Composition of relations

In the mathematics of binary relations, the composition of relations is the forming of a new binary relation from two given binary relations R and S. In the calculus of relations, the composition of relations is called relative multiplication, and its result is called a relative product.

See Logical matrix and Composition of relations

## Costas array

In mathematics, a Costas array can be regarded geometrically as a set of n points, each at the center of a square in an n×n square tiling such that each row or column contains only one point, and all of the n(n − 1)/2 displacement vectors between each pair of dots are distinct.

See Logical matrix and Costas array

## D. R. Fulkerson

Delbert Ray Fulkerson (August 14, 1924 – January 10, 1976) was an American mathematician who co-developed the FordNdashFulkerson algorithm, one of the most well-known algorithms to solve the maximum flow problem in networks.

See Logical matrix and D. R. Fulkerson

## De Bruijn torus

In combinatorial mathematics, a De Bruijn torus, named after Dutch mathematician Nicolaas Govert de Bruijn, is an array of symbols from an alphabet (often just 0 and 1) that contains every possible matrix of given dimensions exactly once.

See Logical matrix and De Bruijn torus

## Design matrix

In statistics and in particular in regression analysis, a design matrix, also known as model matrix or regressor matrix and often denoted by X, is a matrix of values of explanatory variables of a set of objects. Logical matrix and design matrix are matrices.

See Logical matrix and Design matrix

## Directed graph

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.

See Logical matrix and Directed graph

## Disjunct matrix

In mathematics, a logical matrix may be described as d-disjunct and/or d-separable.

See Logical matrix and Disjunct matrix

## Divisor

In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a multiple of m. An integer n is divisible or evenly divisible by another integer m if m is a divisor of n; this implies dividing n by m leaves no remainder.

See Logical matrix and Divisor

## Equality (mathematics)

In mathematics, equality is a relationship between two quantities or, more generally, two mathematical expressions, asserting that the quantities have the same value, or that the expressions represent the same mathematical object.

See Logical matrix and Equality (mathematics)

## Expected value

In probability theory, the expected value (also called expectation, expectancy, expectation operator, mathematical expectation, mean, expectation value, or first moment) is a generalization of the weighted average.

See Logical matrix and Expected value

## Finite field

In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements.

See Logical matrix and Finite field

## Finite geometry

A finite geometry is any geometric system that has only a finite number of points.

See Logical matrix and Finite geometry

## Finite set

In mathematics, particularly set theory, a finite set is a set that has a finite number of elements.

See Logical matrix and Finite set

## Gale–Ryser theorem

The Gale–Ryser theorem is a result in graph theory and combinatorial matrix theory, two branches of combinatorics.

See Logical matrix and Gale–Ryser theorem

## Go (game)

# Go is an abstract strategy board game for two players in which the aim is to capture more territory than the opponent by fencing off empty space.

See Logical matrix and Go (game)

## Graph (discrete mathematics)

In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related".

See Logical matrix and Graph (discrete mathematics)

## Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.

See Logical matrix and Graph theory

## Groupoid

In mathematics, especially in category theory and homotopy theory, a groupoid (less often Brandt groupoid or virtual group) generalises the notion of group in several equivalent ways.

See Logical matrix and Groupoid

## H. J. Ryser

Herbert John Ryser (July 28, 1923 – July 12, 1985) was a professor of mathematics, widely regarded as one of the major figures in combinatorics in the 20th century.

See Logical matrix and H. J. Ryser

## Homogeneous relation

In mathematics, a homogeneous relation (also called endorelation) on a set X is a binary relation between X and itself, i.e. it is a subset of the Cartesian product.

See Logical matrix and Homogeneous relation

## Idempotence

Idempotence is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application.

See Logical matrix and Idempotence

## Identity matrix

In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere. Logical matrix and identity matrix are matrices.

See Logical matrix and Identity matrix

## Incidence geometry

In mathematics, incidence geometry is the study of incidence structures.

See Logical matrix and Incidence geometry

## Incidence matrix

In mathematics, an incidence matrix is a logical matrix that shows the relationship between two classes of objects, usually called an incidence relation. Logical matrix and incidence matrix are matrices.

See Logical matrix and Incidence matrix

## Incidence structure

In mathematics, an incidence structure is an abstract system consisting of two types of objects and a single relationship between these types of objects.

See Logical matrix and Incidence structure

## Inclusion (logic)

In logic and mathematics, inclusion is the concept that all the contents of one object are also contained within a second object.

See Logical matrix and Inclusion (logic)

## Indexed family

In mathematics, a family, or indexed family, is informally a collection of objects, each associated with an index from some index set.

See Logical matrix and Indexed family

## Information and Computation

Information and Computation is a closed-access computer science journal published by Elsevier (formerly Academic Press).

See Logical matrix and Information and Computation

## Integer

An integer is the number zero (0), a positive natural number (1, 2, 3,...), or the negation of a positive natural number (−1, −2, −3,...). The negations or additive inverses of the positive natural numbers are referred to as negative integers.

See Logical matrix and Integer

## Irving Copi

Irving Marmer Copi (né Copilovich or Copilowish; July 28, 1917 – August 19, 2002) was an American philosopher, logician, and university textbook author.

See Logical matrix and Irving Copi

## Journal of Symbolic Logic

The Journal of Symbolic Logic is a peer-reviewed mathematics journal published quarterly by Association for Symbolic Logic.

See Logical matrix and Journal of Symbolic Logic

## L. R. Ford Jr.

Lester Randolph Ford Jr. (September 23, 1927 – February 26, 2017) was an American mathematician specializing in network flow problems.

See Logical matrix and L. R. Ford Jr.

## Lattice (order)

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.

See Logical matrix and Lattice (order)

## List of named matrices

This article lists some important classes of matrices used in mathematics, science and engineering. Logical matrix and list of named matrices are matrices.

See Logical matrix and List of named matrices

## Logical conjunction

In logic, mathematics and linguistics, and (\wedge) is the truth-functional operator of conjunction or logical conjunction.

See Logical matrix and Logical conjunction

## Logical disjunction

In logic, disjunction, also known as logical disjunction or logical or or logical addition or inclusive disjunction, is a logical connective typically notated as \lor and read aloud as "or".

See Logical matrix and Logical disjunction

## Loop (graph theory)

In graph theory, a loop (also called a self-loop or a buckle) is an edge that connects a vertex to itself.

See Logical matrix and Loop (graph theory)

## Magma (algebra)

In abstract algebra, a magma, binar, or, rarely, groupoid is a basic kind of algebraic structure.

See Logical matrix and Magma (algebra)

## Matrix (mathematics)

In mathematics, a matrix (matrices) is a rectangular array or table of numbers, symbols, or expressions, with elements or entries arranged in rows and columns, which is used to represent a mathematical object or property of such an object. Logical matrix and matrix (mathematics) are matrices.

See Logical matrix and Matrix (mathematics)

## Matrix multiplication

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices.

See Logical matrix and Matrix multiplication

## Modular arithmetic

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus.

See Logical matrix and Modular arithmetic

## Outer product

In linear algebra, the outer product of two coordinate vectors is the matrix whose entries are all products of an element in the first vector with an element in the second vector.

See Logical matrix and Outer product

## Pacific Journal of Mathematics

The Pacific Journal of Mathematics is a mathematics research journal supported by several universities and research institutes, and currently published on their behalf by Mathematical Sciences Publishers, a non-profit academic publishing organisation, and the University of California, Berkeley.

See Logical matrix and Pacific Journal of Mathematics

## Partially ordered set

In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other.

See Logical matrix and Partially ordered set

## Permutation matrix

In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column with all other entries 0. Logical matrix and permutation matrix are matrices.

See Logical matrix and Permutation matrix

## Phase space

In dynamical systems theory and control theory, a phase space or state space is a space in which all possible "states" of a dynamical system or a control system are represented, with each possible state corresponding to one unique point in the phase space.

See Logical matrix and Phase space

## Pixel

In digital imaging, a pixel (abbreviated px), pel, or picture element is the smallest addressable element in a raster image, or the smallest addressable element in a dot matrix display device.

## Prime number

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.

See Logical matrix and Prime number

## Prime-counting function

In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number.

See Logical matrix and Prime-counting function

## Princeton University Press

Princeton University Press is an independent publisher with close connections to Princeton University.

See Logical matrix and Princeton University Press

## Quadratic sieve

The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known (after the general number field sieve).

See Logical matrix and Quadratic sieve

## Quasigroup

In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that "division" is always possible.

See Logical matrix and Quasigroup

## Raster graphics

smiley face in the top left corner is a raster image. When enlarged, individual pixels appear as squares. Enlarging further, each pixel can be analyzed, with their colors constructed through combination of the values for red, green and blue. In computer graphics and digital photography, a raster graphic represents a two-dimensional picture as a rectangular matrix or grid of pixels, viewable via a computer display, paper, or other display medium.

See Logical matrix and Raster graphics

## Recurrence plot

In descriptive statistics and chaos theory, a recurrence plot (RP) is a plot showing, for each moment i in time, the times at which the state of a dynamical system returns to the previous state at i, i.e., when the phase space trajectory visits roughly the same area in the phase space as at time j. In other words, it is a plot of showing i on a horizontal axis and j on a vertical axis, where \vec is the state of the system (or its phase space trajectory).

See Logical matrix and Recurrence plot

## Redheffer matrix

In mathematics, a Redheffer matrix, often denoted A_n as studied by, is a square (0,1) matrix whose entries aij are 1 if i divides j or if j. Logical matrix and Redheffer matrix are matrices.

See Logical matrix and Redheffer matrix

## Reflexive relation

In mathematics, a binary relation R on a set X is reflexive if it relates every element of X to itself.

See Logical matrix and Reflexive relation

## Richard A. Brualdi

Richard Anthony Brualdi is a professor emeritus of combinatorial mathematics at the University of Wisconsin–Madison.

See Logical matrix and Richard A. Brualdi

## Semiring

In abstract algebra, a semiring is an algebraic structure.

See Logical matrix and Semiring

## Smooth number

In number theory, an n-smooth (or n-friable) number is an integer whose prime factors are all less than or equal to n. For example, a 7-smooth number is a number in which every prime factor is at most 7.

See Logical matrix and Smooth number

## Square-free integer

In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1.

See Logical matrix and Square-free integer

## Symmetric matrix

In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Logical matrix and symmetric matrix are matrices.

See Logical matrix and Symmetric matrix

## Theoretical computer science

Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.

See Logical matrix and Theoretical computer science

## Three-valued logic

In logic, a three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value.

See Logical matrix and Three-valued logic

## Transition system

In theoretical computer science, a transition system is a concept used in the study of computation.

See Logical matrix and Transition system

## Truth table

A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, Boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arguments, that is, for each combination of values taken by their logical variables. Logical matrix and truth table are Boolean algebra.

See Logical matrix and Truth table

## References

Also known as (0,1) matrix, (0,1)-matrices, (0,1)-matrix, 0,1-matrix, 0-1 matrix, Binary matrix, Logical matrices, Logical vector, Matrix logic, Zero-One matrix.