Bridget Eileen Tenner is a professor of mathematics at DePaul University in Chicago. Her scholarly work is anchored in the study of permutation patterns and extends into several closely related areas of pure and applied mathematics, including algebraic combinatorics, discrete geometry, Coxeter groups, and electoral geography. This article offers an in‑depth look at Tenner’s academic profile, the mathematical domains she explores, why those domains matter to contemporary research, and how her contributions fit within the broader landscape of mathematics education and discovery.
Table of Contents
- [Academic Position and Institutional Context](#academic-position)
- [Research Overview](#research-overview)
- 2.1 [Permutation Patterns](#permutation-patterns)
- 2.2 [Algebraic Combinatorics](#algebraic-combinatorics)
- 2.3 [Discrete Geometry](#discrete-geometry)
- 2.4 [Coxeter Groups](#coxeter-groups)
- 2.5 [Electoral Geography](#electoral-geography)
- [Why These Areas Matter](#why-matter)
- [Interdisciplinary Connections](#interdisciplinary)
- [Teaching, Mentorship, and Community Engagement](#teaching)
- [Future Directions and Open Problems](#future)
- [Conclusion](#conclusion)
- [FAQ](#faq)
<a name="academic-position"></a>
1. Academic Position and Institutional Context
Bridget Tenner holds a faculty appointment in the Department of Mathematics at DePaul University, a private Catholic research university located in the heart of Chicago, Illinois. DePaul’s mathematics department is known for balancing rigorous theoretical training with applied problem‑solving, offering undergraduate and graduate programs that emphasize both depth and breadth.
As a professor, Tenner participates in the typical triad of academic responsibilities: research, teaching, and service. While the specific courses she teaches are not enumerated here, a professor with her research profile often leads courses in combinatorics, abstract algebra, and geometry, providing students with exposure to the same topics that shape her own investigations.
Chicago’s vibrant mathematical community—home to the University of Chicago, Northwestern University, and several research institutes—offers a fertile environment for collaboration, conference participation, and interdisciplinary dialogue. Tenner’s position within this ecosystem enables her to both draw from and contribute to a rich tradition of combinatorial and geometric research.
<a name="research-overview"></a>
2. Research Overview
Tenner’s scholarly output revolves around a core focus on permutation patterns, while also encompassing a suite of related fields. Below each area is described in a way that highlights its foundational concepts, current research frontiers, and the ways in which Tenner’s work advances understanding.
<a name="permutation-patterns"></a>
2.1 Permutation Patterns
A permutation is an ordering of a finite set of elements, typically the integers \(1,2,\dots,n\). A pattern within a permutation is a smaller ordering that appears when one selects a subsequence and relabels it to maintain relative order. For example, the pattern 132 occurs in the permutation 41523 because the subsequence (4,5,3) preserves the relative order “first smallest, then largest, then middle.”
The study of permutation patterns asks questions such as:
- Enumeration: How many permutations of length \(n\) avoid a given pattern?
- Structure: What combinatorial objects (e.g., trees, lattice paths) correspond to pattern‑avoiding classes?
- Algorithmic detection: How efficiently can we test whether a permutation contains a particular pattern?
These questions intersect with enumerative combinatorics, algorithmic theory, and even statistical physics, where pattern avoidance models phenomena such as sorting processes and polymer folding.
Tenner’s research contributes to this field by exploring new families of patterns, developing bijective proofs that link pattern‑avoiding permutations to other combinatorial structures, and investigating the algebraic properties of pattern classes. Her work often uncovers unexpected symmetries and leads to refined counting formulas that deepen the theoretical toolbox available to combinatorialists.
<a name="algebraic-combinatorics"></a>
2.2 Algebraic Combinatorics
Algebraic combinatorics blends combinatorial enumeration with algebraic structures such as groups, rings, and modules. Central objects include symmetric functions, representation theory of symmetric groups, and generating functions that encode combinatorial data.
In the context of permutation patterns, algebraic combinatorics provides powerful methods for:
- Translating pattern avoidance into statements about Schur functions or Hall–Littlewood polynomials.
- Using representation theory to classify pattern classes via irreducible modules.
- Applying Hopf algebra techniques to study the algebraic operations that combine permutations.
Tenner’s investigations often leverage these algebraic frameworks to obtain closed‑form expressions for enumeration problems that would otherwise be intractable. By situating pattern‑avoidance questions within an algebraic context, she helps bridge the gap between concrete combinatorial counting and abstract algebraic theory.
<a name="discrete-geometry"></a>
2.3 Discrete Geometry
Discrete geometry examines geometric structures that are fundamentally combinatorial—think of point configurations, polyhedral tilings, and lattice arrangements. Problems typically involve counting configurations, understanding incidence relations, and exploring extremal properties.
Connections to permutation patterns arise through:
- Geometric representations of permutations, such as plotting points \((i, \pi(i))\) in the plane and studying the resulting point set’s convex hull.
- Pattern avoidance interpreted as the absence of certain geometric configurations (e.g., monotone subsequences correspond to specific convex chains).
Tenner’s work in discrete geometry often investigates how pattern‑avoidance constraints shape the geometry of point sets, leading to results about the possible shapes of convex hulls, the distribution of lattice points, and the combinatorial types of associated polytopes. These insights have implications for computational geometry, where understanding the structure of point clouds is essential for algorithms in graphics, robotics, and data analysis.
<a name="coxeter-groups"></a>
2.4 Coxeter Groups
A Coxeter group is a group generated by reflections across hyperplanes, defined by a presentation with relations of the form \((s_i s_j)^{m_{ij}} = 1\). Classical examples include the symmetric group (type \(A_n\)), the hyperoctahedral group (type \(B_n\)), and the dihedral groups. Coxeter groups underlie much of modern algebraic combinatorics because they encode symmetry in a combinatorial language.
Research intersections include:
- Pattern avoidance in Coxeter groups: Extending the notion of permutation patterns to signed permutations (type \(B\)) or more general Coxeter elements.
- Bruhat order: A partial order on Coxeter group elements that reflects combinatorial structure and geometric representation.
- Hecke algebras: Deformations of group algebras of Coxeter groups that play a role in representation theory and knot invariants.
Tenner’s contributions often explore how pattern‑avoidance ideas translate into the language of Coxeter groups, producing new classifications of elements that avoid certain substructures. Such work not only enriches the theory of Coxeter groups but also informs related areas like Schubert calculus and geometric representation theory.
<a name="electoral-geography"></a>
2.5 Electoral Geography
Electoral geography studies the spatial distribution of voting behavior, district boundaries, and the demographic factors that influence electoral outcomes. While at first glance this field appears distinct from pure combinatorics, there are deep combinatorial underpinnings: redistricting problems can be modeled as graph‑partitioning tasks, and the enumeration of possible district maps often involves combinatorial counting.
Tenner’s foray into electoral geography typically applies combinatorial techniques to:
- Quantify the number of viable districting plans under legal constraints (e.g., contiguity, equal population).
- Analyze the impact of geometric constraints (such as compactness) on the space of possible maps.
- Develop statistical models that assess the likelihood of partisan bias emerging from random districting.
By bringing rigorous combinatorial analysis to electoral geography, Tenner contributes to a growing body of work that seeks to make redistricting more transparent, mathematically grounded, and resistant to manipulation.
<a name="why-matter"></a>
3. Why These Areas Matter
The domains that Tenner studies are not isolated academic curiosities; they have tangible relevance across mathematics and beyond.
- Permutation patterns provide a testing ground for general principles of enumeration, generating function theory, and algorithmic complexity. Results in this area often translate to improved sorting algorithms and data‑structure optimizations.
- Algebraic combinatorics supplies the language for describing symmetries in physics (e.g., particle statistics), coding theory, and even quantum computing, where representation‑theoretic insights can inform error‑correcting codes.
- Discrete geometry underpins computational geometry, which powers computer graphics, geographic information systems (GIS), and robotics path planning. Understanding the combinatorial constraints of point configurations can lead to more efficient algorithms.
- Coxeter groups are central to the classification of Lie algebras, the study of crystal structures in chemistry, and the theory of tessellations in architecture. Their combinatorial properties influence both pure mathematical theory and applied design.
- Electoral geography directly impacts democratic processes. By applying combinatorial rigor to redistricting, researchers help ensure that electoral maps are drawn fairly, adhering to legal standards while minimizing partisan gerrymandering.
Collectively, these fields illustrate how abstract combinatorial reasoning can ripple outward, shaping technology, policy, and scientific understanding.
<a name="interdisciplinary"></a>
4. Interdisciplinary Connections
Tenner’s portfolio of research topics naturally encourages cross‑disciplinary collaboration:
- Computer Science: Algorithms for detecting permutation patterns intersect with pattern‑matching and machine learning.
- Statistics: Enumeration of electoral maps dovetails with probabilistic modeling of voting outcomes.
- Physics: Coxeter groups describe symmetry groups of crystals and quasicrystals, linking algebraic combinatorics to materials science.
- Urban Planning: Discrete geometry informs the layout of transportation networks and the design of public spaces.
By publishing in venues that span mathematics, computer science, and social science, Tenner helps disseminate combinatorial insights to audiences that can apply them in concrete settings.
<a name="teaching"></a>
5. Teaching, Mentorship, and Community Engagement
While the source does not list specific teaching activities, a professor of mathematics at a research university typically engages in:
- Course development for undergraduate and graduate curricula, often integrating research topics such as permutation patterns into classroom examples.
- Supervision of graduate students who pursue theses in combinatorics, geometry, or related fields, thereby cultivating the next generation of scholars.
- Outreach through seminars, workshops, and conference organization, especially in a city like Chicago where mathematical societies host frequent events.
These responsibilities amplify Tenner’s impact beyond her own publications, fostering a vibrant learning environment and encouraging collaborative inquiry among students and colleagues.
<a name="future"></a>
6. Future Directions and Open Problems
The landscape of combinatorial research is punctuated by enduring conjectures and emerging questions. Tenner’s work positions her to address several high‑impact problems:
- Universal enumeration formulas for larger families of pattern‑avoiding permutations remain elusive. Extending known results to broader classes could unify disparate counting techniques.
- Algebraic structures of pattern classes: Understanding whether every pattern‑avoidance class admits a natural Hopf algebra structure is an open avenue that blends algebraic combinatorics with category theory.
- Geometric realizations of Coxeter‑group patterns: Identifying explicit polyhedral models that reflect pattern‑avoidance constraints could deepen the link between algebraic and geometric combinatorics.
- Quantitative fairness metrics in electoral geography: Developing combinatorial measures that capture the trade‑off between compactness, community preservation, and partisan balance is a pressing challenge for democratic reform.
By pursuing these topics, Tenner continues to push the boundaries of what combinatorial mathematics can explain and achieve.
<a name="conclusion"></a>
7. Conclusion
Bridget Eileen Tenner exemplifies the modern mathematician whose research traverses a spectrum of interrelated fields—permutation patterns, algebraic combinatorics, discrete geometry, Coxeter groups, and electoral geography—while rooted in a single academic home at DePaul University in Chicago. Her contributions illuminate the deep combinatorial structures that underlie both pure mathematical theory and practical societal concerns such as fair representation.
Through rigorous investigation, mentorship of emerging scholars, and participation in Chicago’s thriving mathematical community, Tenner helps ensure that combinatorial thinking remains a vital, evolving force in contemporary science and public policy.
<a name="faq"></a>
FAQ
Who is Bridget Tenner? Bridget Eileen Tenner is a professor of mathematics at DePaul University in Chicago whose research focuses on permutation patterns and also includes work in algebraic combinatorics, discrete geometry, Coxeter groups, and electoral geography.
What are permutation patterns? A permutation pattern is a smaller ordered sequence that appears within a larger permutation when the relative order of selected elements is preserved. Researchers study how many permutations avoid a given pattern, the structures of those avoiding classes, and algorithmic methods for detecting patterns.
Why are Coxeter groups important in mathematics? Coxeter groups are abstract groups generated by reflections, capturing symmetry in a combinatorial framework. They appear in the classification of Lie algebras, geometry of tilings, and representation theory, providing a unifying language for many areas of mathematics and physics.