Journal of Combinatorial Theory Series A

15 papers2 directions
The Journal of Combinatorial Theory Series A is a long-standing publication, active since 1973, that focuses on discrete mathematics and combinatorial structures. In the context of machine learning and artificial intelligence, the venue serves as a foundational resource for theoretical research. It publishes work on the mathematical properties of structures that underpin algorithmic efficiency and data representation, such as graph complexes, orthogonal arrays, and Steiner systems. Research directions represented at this venue include the navigation of combinatorial explosions in evolutionary trees and methods for uniform sampling through counting and self-reducibility. These topics are relevant to probabilistic modeling and the analysis of complex search spaces. The journal also features studies on constant weight codes, permutation vectors, and the enumeration of tanglegrams, which contribute to the theoretical understanding of information theory and structural biology within computational frameworks. Frequent contributors to the journal include L. Sunil Chandran, Rishikesh Gajjala, and Chong Shangguan, among others. The publication covers a broad range of topics including multivariable Lagrange inversion, the Matrix Tree Theorem, and the properties of antichains. By providing rigorous analysis of these discrete structures, the journal supports the development of mathematical tools used in optimization and the design of algorithms for AI applications.

Papers by Year

2026 1
2024 2
2022 1
2020 2
2016 1
2014 1
2012 1
2010 1
1997 2
1994 2
1977 1
1973 1

Top Research Directions

Research directions most represented by papers from this venue.

Combinatorial Interpretations of Symmetric Function Operators 3
Proving Algebraic Identities Through Combinatorial Bijections 1

Top Authors

AuthorPapers
Angela Hicks1
Jean-Christophe Aval1
Luca Moci1
Mark Dukes1
Yvan Le Borgne1

Papers

TitleYear
On the smallest antichain that generates an ideal of a given size2026
Approximate generalized Steiner systems and near-optimal constant weight codes2024
The vector space generated by permutations of a trade or a design2024
Leray numbers of complexes of graphs with bounded matching number2022
e-Positivity of vertical strip LLT polynomials2020
On the enumeration of tanglegrams and tangled chains2016
Statistics on parallelogram polyominoes and a<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mat2014
Graph colorings, flows and arithmetic Tutte polynomial2012
On the existence of orthogonal arrays <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="normal">OA</mml:mi><mml:mo stretchy="false">(</mm2010
Areas of GeneralizedH-Polygons1997
Multivariable Lagrange Inversion, Gessel-Viennot Cancellation, and the Matrix Tree Theorem1997
Autocorrelation on words and its applications1994
Decompositions of Bn and Πn using symmetric chains1994
An extremal problem among subsets of a set1977
On copositive matrices with −1, 0, 1 entries1973