Thomas Zaslavsky

Q: What Schools Are Affiliated With Thomas Zaslavsky

Thomas Zaslavsky is affiliated with the following schools: Binghamton University, Ohio State University, Massachusetts Institute of Technology

Thomas Zaslavsky's AcademicInfluence.com Rankings

Thomas Zaslavsky

Mathematics

#4459

World Rank

#6330

Historical Rank

#1531

USA Rank

Measure Theory

#2033

World Rank

#2465

Historical Rank

#602

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Thomas Zaslavsky Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Thomas Zaslavsky is an American mathematician specializing in combinatorics. Zaslavsky's mother Claudia Zaslavsky was a high school mathematics teacher and an ethnomathematician in New York; his father Sam Zaslavsky was an electrical engineer. Thomas Zaslavsky graduated from the City College of New York. At M.I.T. he studied hyperplane arrangements with Curtis Greene and received a Ph.D. in 1974. In 1975 the American Mathematical Society published his doctoral thesis.

(See a Problem?)

Thomas Zaslavsky's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes (1975) (636)
ON THE INTERPRETATION OF WHITNEY NUMBERS THROUGH ARRANGEMENTS OF HYPERPLANES, ZONOTOPES, NON-RADON PARTITIONS, AND ORIENTATIONS OF GRAPHS (1983) (233)
Biased graphs. I. Bias, balance, and gains (1989) (219)
Averaging sets: A generalization of mean values and spherical designs (1984) (219)
Signed graphs (1982) (161)
Signed graph coloring (1982) (161)
Matrices in the Theory of Signed Simple Graphs (2013) (143)
Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74 (1983) (138)
Biased graphs. II. The three matroids (1991) (133)
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas (2018) (122)
Orientation of Signed Graphs (1991) (100)
On products and line graphs of signed graphs, their eigenvalues and energy (2010) (90)
The Geometry of Root Systems and Signed Graphs (1981) (83)
Inside-out polytopes (2003) (81)
Characterizations of signed graphs (1981) (78)
Combinatorial Geometries: The Möbius Function and the Characteristic Polynomial (1987) (69)
Glossary of signed and gain graphs and allied areas. (1998) (60)
A combinatorial analysis of topological dissections (1977) (60)
The number of nowhere-zero flows on graphs and signed graphs (2003) (53)
Strong Tutte functions of matroids and graphs (1992) (50)
Chromatic invariants of signed graphs (1982) (48)
Biased graphs IV: Geometrical realizations (2003) (42)
Asymptotic Expansions of Ratios of Coefficients of Orthogonal Polynomials with Exponential Weights (1985) (38)
The number of cladistic characters (1981) (36)
Counting the faces of cut-up spaces (1975) (34)
Frame Matroids and Biased Graphs (1994) (32)
Biased Graphs .III. Chromatic and Dichromatic Invariants (1995) (30)
Homomorphisms of signed graphs: An update (2019) (29)
Signed analogs of bipartite graphs (1998) (28)
Signed Graphs and Geometry (2013) (28)
Orientation embedding of signed graphs (1992) (25)
An Enumerative Geometry for Magic and Magilatin Labellings (2005) (24)
Biased graphs whose matroids are special binary matroids (1990) (24)
Balanced decompositions of a signed graph (1987) (23)
A Coding Approach to Signed Graphs (1994) (23)
The projective-planar signed graphs (1993) (21)
BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH (1982) (21)
How colorful the signed graph? (1984) (21)
Vertices of localized imbalance in a biased graph (1987) (20)
Glossary of Signed and Gain Graphs (2002) (17)
Supersolvable Frame-matroid and Graphic-lift Lattices (2001) (16)
Perpendicular Dissections of Space (2010) (15)
Six signed Petersen graphs, and their automorphisms (2012) (15)
The biased graphs whose matroids are binary (1987) (14)
The Covering Radius of the Cycle Code of a Graph (1993) (13)
Associativity in multiary quasigroups: the way of biased expansions (2004) (13)
Complementary Matching Vectors and the Uniform Matching Extension Property (1981) (13)
A $$q$$q-Queens Problem. II. The square board (2014) (13)
A q-Queens Problem. I. General Theory (2013) (12)
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements (2006) (11)
The Order Upper Bound on Parity Embedding of a Graph (1996) (11)
Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry (2002) (11)
Research Areas (2006) (10)
Negative (and positive) circles in signed graphs: A problem collection (2017) (10)
The Largest Parity Demigenus of a Simple Graph (1997) (9)
The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements (1981) (9)
Is There a Matroid Theory of Signed Graph Embedding? (1997) (9)
A simple algorithm that proves half‐integrality of bidirected network programming (2006) (9)
Maximal Dissections of a Simplex (1976) (9)
Signed distance in signed graphs (2020) (9)
Consistency in the Naturally Vertex-Signed Line Graph of a Signed Graph (2014) (8)
Six Little Squares and How Their Numbers Grow (2010) (8)
Voltage-Graphic Matroids (2010) (8)
Totally frustrated states in the chromatic theory of gain graphs (2006) (8)
Mock threshold graphs (2016) (8)
A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains (2001) (7)
EXTREMAL ARRANGEMENTS OF HYPERPLANES a (1985) (7)
Criteria for Balance in Abelian Gain Graphs ∗ (2002) (7)
Biased graphs. VII. Contrabalance and antivoltages (2007) (6)
Line graphs of switching classes (1984) (6)
Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs (2013) (6)
On the division of space by topological hyperplanes (2006) (5)
A q-queens problem III. Nonattacking partial queens (2014) (5)
A simple algorithm that proves half-integrality of bidirected network programming (2006) (5)
GEOMETRIC LATTICES OF STRUCTURED PARTITIONS I. Gain-graphic matroids and group valued partitions* (1992) (4)
Characterization of Line-Consistent Signed Graphs (2014) (4)
A q-queens problem. VI. The bishops' period (2014) (4)
An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements (2009) (4)
The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring (1995) (4)
A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders (2016) (4)
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups (2002) (4)
Point- and arc-reaching sets of vertices in a digraph (2010) (4)
Nonattacking Queens in a Rectangular Strip (2010) (4)
The slimmest arrangements of hyperplanes (1983) (4)
Biased Graphs. V. Group and Biased Expansions (2002) (4)
Maximality of the cycle code of a graph (1994) (4)
A unifying generalization of Sperner's theorem (2001) (4)
The largest demigenus of a bipartite signed graph (2001) (4)
A q-Queens Problem IV. Attacking configurations and their denominators (2018) (3)
The dimension of the negative cycle vectors of a signed graph (2017) (3)
Resolution of indecomposable integral flows on signed graphs (2017) (3)
A short generalization of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains (2001) (3)
A Meshalkin theorem for projective geometries (2001) (3)
Frustration vs . Clusterability in Two-Mode Signed Networks ( Signed Bipartite Graphs ) (2010) (3)
Total graph of a signed graph (2019) (3)
Avoiding the Identity: 10606 (1999) (2)
Determinants in the Kronecker product of matrices: the incidence matrix of a complete graph (2008) (2)
in the Theory of Signed Simple Graphs (2008) (2)
Forbidden Induced Subgraphs (2016) (2)
Directionally 2-Signed and Bidirected Graphs (2013) (2)
Periodicity in Quasipolynomial Convolution (2004) (2)
Characterizations of some parity signed graphs (2020) (2)
Transitive closure and transitive reduction in bidirected graphs (2016) (2)
Tractable Partially Ordered Sets Derived from Root Systems and Biased Graphs (1997) (2)
Se p 20 03 Criteria for Balance in Abelian Gain Graphs , with an Application to Piecewise-Linear Geometry ∗ (2003) (2)
Quasigroup associativity and biased expansion graphs (2006) (2)
Biased graphs. VI. synthetic geometry (2016) (2)
Matroids determine the embeddability of graphs in surfaces (1989) (1)
Language influences on prospective mathematics teachers' understanding of probabilistic concepts (2001) (1)
Polynomial Tutte Invariants of Rooted Integral Gain Graphs (2005) (1)
The Canonical Vertex Signature and the Cosets of the Complete Binary Cycle Space (2010) (1)
The Dynamics of the Forest Graph Operator (2016) (1)
Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property" (1981) (1)
Interference in Graphs (2014) (1)
Criteria for Balance in Abelian Gain Graphs with Applications to Geometry (2002) (1)
A q-queens problem VII: Combinatorial types of nonattacking chess riders (2019) (1)
Two Hamiltonian cycles (2021) (1)
A $q$-Queens Problem. IV. Queens, Bishops, Nightriders (and Rooks) (2016) (1)
A new distribution problem of balls into urns, and how to color a graph by different-sized sets (2006) (1)
On Adjacency Matrices and Descriptors of Signed Cycle Graphs (2013) (1)
Which Exterior Powers are Balanced? (2013) (1)
Colorations , Orthotopes , and a Huge Polynomial Tutte Invariant of Weighted Gain Graphs Version of May 12 , 2007 David Forge (2007) (1)
Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Application to Plane, Plaids, and Shi (2003) (1)
Togs (generalizations of Two-graphs) (1986) (1)
Negative Circles in Signed Graphs: A Problem Collection (2016) (0)
Whitney Numbers of Partial Dowling Lattices (2022) (0)
The Projective Planarity Question for Matroids of $3$-Nets and Biased Graphs (2017) (0)
Signed analogs of bipartite graphs 1 (1998) (0)
The characteristic polynomial of agraph containing loops (2020) (0)
Strongly connectable digraphs and non-transitive dice (2015) (0)
Signed distance Laplacian matrices for signed graphs (2020) (0)
The Tutte decomposition (1986) (0)
Matroids of Gain Signed Graphs (2022) (0)
New concept of connection in signed graphs (2017) (0)
C O ] 1 5 A ug 2 00 5 INSIDE-OUT POLYTOPES (2003) (0)
Uniform Distribution of a Subgraph in a Graph (1983) (0)
Preface (2017) (0)
Problems: 10606-10612 (1997) (0)
for Lectures on Signed Graphs and Geometry (2010) (0)
WEAK TUTTE FUNCTIONS OF MATROIDS (2006) (0)
Construction of Line-Consistent Signed Graphs (2009) (0)
Associativity in multiary quasigroups: the way of biased expansions (2011) (0)
Vector Valued Switching in Signed Graphs (2022) (0)
Consistency in the Naturally Vertex-Signed Line Graph of a Signed Graph (2015) (0)
A q-QUEENS PROBLEM I. GENERAL THEORY MARCH 3, 2013 (2013) (0)
VERTICES OF LOCALIZED IMBALANCE (2010) (0)
STRONG TUTTE FUNCTIONS OF MATROIDS AND GRAPHS 319 matroid (1992) (0)
THE LEAST POSSIBLE EIGENVALUE OF A SUPER LINE MULTIGRAPH (2008) (0)
Spectra of signed total graphs (2019) (0)
LECTURES ON GAIN GRAPHS AND HYPERPLANE ARRANGEMENTS (2020) (0)
Projective planarity of matroids of 3-nets and biased graphs (2020) (0)
The characteristic polynomial of a graph containing loops (2021) (0)
Advanced Problems: 6661-6663 (1991) (0)
Magic Squares and Nontransitive Dice: 11099 (2006) (0)
CHROMA'rlC INVARIA.NT$ OF SIGHED GRAPHS (1982) (0)
Transitive closure and transitive reduction in bidirected graphs (2019) (0)
Preface (2012) (0)
PETERSEN SIGNED GRAPHS PARTIAL DRAFT June 8 , 2009 (2009) (0)
C O ] 7 D ec 2 00 1 A unifying generalization of Sperner ’ s theorem (2001) (0)

This paper list is powered by the following services:

Other Resources About Thomas Zaslavsky

en.wikipedia.org

What Schools Are Affiliated With Thomas Zaslavsky?

Thomas Zaslavsky is affiliated with the following schools: