Faster access than browser!
30 relations: Algebraic geometry, Binary tree, Bootstrap percolation, Cograph, Combinatorics, Discrete Mathematics (journal), Forbidden graph characterization, Generating function, Induced path, Information Processing Letters, Inversion (discrete mathematics), Lowest common ancestor, NP-completeness, Order dimension, Partially ordered set, Permutation, Permutation graph, Permutation matrix, Permutation pattern, Schröder number, Series-parallel partial order, SIAM Journal on Discrete Mathematics, Skew and direct sums of permutations, Springer Science+Business Media, Stack (abstract data type), Stack-sortable permutation, Time complexity, Tree rotation, Very-large-scale integration, Von Neumann neighborhood.
Algebraic geometry
Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials.
New!!: Separable permutation and Algebraic geometry · See more »
Binary tree
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the and the.
New!!: Separable permutation and Binary tree · See more »
Bootstrap percolation
In statistical mechanics, bootstrap percolation is a percolation process in which a random initial configuration of active cells is selected from a lattice or other space, and then cells with few active neighbors are successively removed from the active set until the system stabilizes.
New!!: Separable permutation and Bootstrap percolation · See more »
Cograph
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union.
New!!: Separable permutation and Cograph · See more »
Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures.
New!!: Separable permutation and Combinatorics · See more »
Discrete Mathematics (journal)
Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications.
New!!: Separable permutation and Discrete Mathematics (journal) · See more »
Forbidden graph characterization
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to the family and further exclude all graphs from the family which contain any of these forbidden graphs as (induced) subgraph or minor.
New!!: Separable permutation and Forbidden graph characterization · See more »
Generating function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers (an) by treating them as the coefficients of a power series.
New!!: Separable permutation and Generating function · See more »
Induced path
In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a sequence of vertices in G such that each two adjacent vertices in the sequence are connected by an edge in G, and each two nonadjacent vertices in the sequence are not connected by any edge in G. An induced path is sometimes called a snake, and the problem of finding long induced paths in hypercube graphs is known as the snake-in-the-box problem.
New!!: Separable permutation and Induced path · See more »
Information Processing Letters
Information Processing Letters is a peer reviewed scientific journal in the field of computer science, published by Elsevier.
New!!: Separable permutation and Information Processing Letters · See more »
Inversion (discrete mathematics)
In computer science and discrete mathematics a sequence has an inversion where two of its elements are out of their natural order.
New!!: Separable permutation and Inversion (discrete mathematics) · See more »
Lowest common ancestor
In graph theory and computer science, the lowest common ancestor (LCA) of two nodes and in a tree or directed acyclic graph (DAG) is the lowest (i.e. deepest) node that has both and as descendants, where we define each node to be a descendant of itself (so if has a direct connection from, is the lowest common ancestor).
New!!: Separable permutation and Lowest common ancestor · See more »
NP-completeness
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Separable permutation and NP-completeness · See more »
Order dimension
In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the intersection of which gives rise to the partial order.
New!!: Separable permutation and Order dimension · See more »
Partially ordered set
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set.
New!!: Separable permutation and Partially ordered set · See more »
Permutation
In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting.
New!!: Separable permutation and Permutation · See more »
Permutation graph
In mathematics, a permutation graph is a graph whose vertices represent the elements of a permutation, and whose edges represent pairs of elements that are reversed by the permutation.
New!!: Separable permutation and Permutation graph · See more »
Permutation matrix
\pi.
New!!: Separable permutation and Permutation matrix · See more »
Permutation pattern
In combinatorial mathematics and theoretical computer science, a permutation pattern is a sub-permutation of a longer permutation.
New!!: Separable permutation and Permutation pattern · See more »
Schröder number
In mathematics, a Schröder number S_n, also called a large Schröder number or big Schröder number, describes the number of lattice paths from the southwest corner (0,0) of an n \times n grid to the northeast corner (n,n), using only single steps north, (0,1); northeast, (1,1); or east, (1,0), that do not rise above the SW–NE diagonal.
New!!: Separable permutation and Schröder number · See more »
Series-parallel partial order
In order-theoretic mathematics, a series-parallel partial order is a partially ordered set built up from smaller series-parallel partial orders by two simple composition operations.
New!!: Separable permutation and Series-parallel partial order · See more »
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics is a peer-reviewed mathematics journal published quarterly by the Society for Industrial and Applied Mathematics (SIAM).
New!!: Separable permutation and SIAM Journal on Discrete Mathematics · See more »
Skew and direct sums of permutations
In combinatorics, the skew sum and direct sum of permutations are two operations to combine shorter permutations into longer ones.
New!!: Separable permutation and Skew and direct sums of permutations · See more »
Springer Science+Business Media
Springer Science+Business Media or Springer, part of Springer Nature since 2015, is a global publishing company that publishes books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing.
New!!: Separable permutation and Springer Science+Business Media · See more »
Stack (abstract data type)
In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations.
New!!: Separable permutation and Stack (abstract data type) · See more »
Stack-sortable permutation
In mathematics and computer science, a stack-sortable permutation (also called a tree permutation) is a permutation whose elements may be sorted by an algorithm whose internal storage is limited to a single stack data structure.
New!!: Separable permutation and Stack-sortable permutation · See more »
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
New!!: Separable permutation and Time complexity · See more »
Tree rotation
In discrete mathematics, tree rotation is an operation on a binary tree that changes the structure without interfering with the order of the elements.
New!!: Separable permutation and Tree rotation · See more »
Very-large-scale integration
Very-large-scale integration (VLSI) is the process of creating an integrated circuit (IC) by combining hundreds of thousands of transistors or devices into a single chip.
New!!: Separable permutation and Very-large-scale integration · See more »
Von Neumann neighborhood
In cellular automata, the von Neumann neighborhood is classically defined on a two-dimensional square lattice and is composed of a central cell and its four adjacent cells.
New!!: Separable permutation and Von Neumann neighborhood · See more »
Redirects here:
References
[1] https://en.wikipedia.org/wiki/Separable_permutation
