S. Gill Williamson

From MaRDI portal
Person:698607

Available identifiers

zbMath Open williamson.s-gillMaRDI QIDQ698607

List of research outcomes





PublicationDate of PublicationType
Subset Sum Instances in ZFC Limbo2020-12-09Paper
On the difficulty of proving P equals NP in ZFC2019-07-25Paper
Combinatorics in ZFC limbo2019-05-24Paper
ZFC independence and subset sum2017-08-28Paper
Lattice exit models2017-05-18Paper
Tensor spaces - the basics2015-10-08Paper
The common-submatrix Laplace expansion2015-05-20Paper
Recursive projections of symmetric tensors and Marcus's proof of the Schur inequality2014-06-19Paper
Lattice Multiverse Models2010-09-10Paper
Ranking and unranking trees with given degree sequences2010-09-10Paper
Ranking and unranking trees with a given number or a given set of leaves2010-09-10Paper
A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS2005-06-22Paper
Spanning trees and function classes2002-09-22Paper
https://portal.mardi4nfdi.de/entity/Q45522722002-08-29Paper
Research problem: combinatorial and multilinear aspects of sign-balanced posets2002-08-04Paper
Large-scale regularities of lattice embeddings of posets2001-01-29Paper
Straightening Bases for Tensor Products2000-05-28Paper
Periodic sorting using minimum delay, recursively constructed merging networks1998-02-18Paper
A loop-free algorithm for generating the linear extensions of a poset1996-11-04Paper
Canonical forms for cycles in bridge graphs1995-10-05Paper
Doubly adjacent gray codes for the symmetric group1994-01-13Paper
https://portal.mardi4nfdi.de/entity/Q40002951993-01-23Paper
https://portal.mardi4nfdi.de/entity/Q39925371992-09-17Paper
A combinatorial study of straightening bases1992-06-25Paper
A sequential sorting network analogous to the batcher merge1991-01-01Paper
The two basic linear time Planarity algorithms: Are they the same?1990-01-01Paper
Menus of kuratowski subgraphs1988-01-01Paper
Generic common minor expansions1987-01-01Paper
Permanents and determinants with generic noncommuting entries1986-01-01Paper
Ranking and unranking planar embeddings1985-01-01Paper
Depth-First Search and Kuratowski Subgraphs1984-01-01Paper
GlobaL analysis of the deiete-contract recursion for graphs and matroids1984-01-01Paper
Central and local limit theorems applied to asymptotic enumeration. III. Matrix recursions1983-01-01Paper
Hook length products and Cayley operators of classical invariant theory1981-01-01Paper
Symmetry operators, polarizations, and a generalized Capelli identity1981-01-01Paper
Combinatorial Gray Codes1980-01-01Paper
Embedding Graphs in the Plane—Algorithmic Aspects1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38776971980-01-01Paper
Construction of minimal representative systems1980-01-01Paper
Recursive matching algorithms and linear orders on the subset lattice1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41355461977-01-01Paper
Combinatorial Structures and Group Invariant Partitions1976-01-01Paper
Ranking Algorithms for Lists of Partitions1976-01-01Paper
Probabilistic analogs of Pólya's enumeration theory1976-01-01Paper
Ranking Algorithms: The Symmetries and Colorations of the n-Cube1976-01-01Paper
Computational Algorithms for the Enumeration of Group Invariant Partitions1975-01-01Paper
On Backtracking: A Combinatorial Description of the Algorithm1974-01-01Paper
A linear algebra setting for the rota-mullin theory of polynomials of binomial type1973-01-01Paper
Tensor compositions and lists of combinatorial structures1973-01-01Paper
Isomorph Rejection and a Theorem of De Bruijn1973-01-01Paper
The combinatorial analysis of patterns and the principle of inclusion- exclusion1972-01-01Paper
Symmetry operators of Kranz product1971-01-01Paper
Pólya's Counting Theorem and a Class of Tensor Identities1971-01-01Paper
Operator theoretic invariants and the enumeration theory of Pólya and de Bruijn1970-01-01Paper
Unitary similarity of symmetry operators1970-01-01Paper
Tensor contraction and Hermitian forms1969-01-01Paper
On a class of combinatorial inequalities1969-01-01Paper
Some Remarks on a Class of Matrix Inequalities1968-01-01Paper
A combinatorial property of finite sequences with an application to tensor algebra1966-01-01Paper
On P=NP Either False or Independent of ZFCN/APaper

Research outcomes over time

This page was built for person: S. Gill Williamson