Media Summary: Talk from the Mid-Atlantic Algebra, Geometry, and Combinatorics Workshop (MAAGC) at the George Washington University, ... Special Year Seminar Topic: Complexity of Slides: Abstract: Can one emulate the simple random walk ...

Swee Hong Chan Log Concave - Detailed Analysis & Overview

Talk from the Mid-Atlantic Algebra, Geometry, and Combinatorics Workshop (MAAGC) at the George Washington University, ... Special Year Seminar Topic: Complexity of Slides: Abstract: Can one emulate the simple random walk ... Title: Spanning trees and continued fractions Abstract: Consider the set of positive integers representing the number of spanning ... Slides: Abstract: Can you always find two elements $x$, $y$ ... Slides: Abstract: Can one emulate the simple random walk without actually doing anything random? This talk will be about a ...

Photo Gallery

Swee Hong Chan, "Log-concave inequalities for posets"
2024.08.22, Swee Hong Chan, Complexity of log-concave inequalities in matroids
Swee Hong Chan - Complexity of log-concave poset inequalities - IPAM at UCLA
Swee Hong Chan: Complexity of log-concave inequalities in matroids
Complexity of Log-concave Inequalities in Matroids - Swee Hong Chan
Swee Hong Chan - Combinatorial atlas for log-concave inequalities
Combinatorial atlas and their applications: Stanley's poset inequalities (by Swee Hong Chan)
Combinatorial atlas and their applications: Introduction of combinatorial atlas (by Swee Hong Chan)
Swee Hong Chan: Performing random walks without any randomness (Purdue March 2021)
Apr 4, 2025: Swee Hong Chan (Spanning trees and continued fractions)
Swee Hong Chan, Sorting probability for Young diagrams
Swee Hong Chan: In between random walk and rotor walk (Cornell Dec 2020)
Sponsored
Sponsored
View Detailed Profile
Swee Hong Chan, "Log-concave inequalities for posets"

Swee Hong Chan, "Log-concave inequalities for posets"

Slides: https://www.math.ucla.edu/~galashin/seminar/SweeHong_LogConcave.pdf Abstract: The study of

2024.08.22, Swee Hong Chan, Complexity of log-concave inequalities in matroids

2024.08.22, Swee Hong Chan, Complexity of log-concave inequalities in matroids

2024 Workshop on (Mostly) Matroids

Sponsored
Swee Hong Chan - Complexity of log-concave poset inequalities - IPAM at UCLA

Swee Hong Chan - Complexity of log-concave poset inequalities - IPAM at UCLA

Recorded 17 April 2024.

Swee Hong Chan: Complexity of log-concave inequalities in matroids

Swee Hong Chan: Complexity of log-concave inequalities in matroids

Talk from the Mid-Atlantic Algebra, Geometry, and Combinatorics Workshop (MAAGC) at the George Washington University, ...

Complexity of Log-concave Inequalities in Matroids - Swee Hong Chan

Complexity of Log-concave Inequalities in Matroids - Swee Hong Chan

Special Year Seminar Topic: Complexity of

Sponsored
Swee Hong Chan - Combinatorial atlas for log-concave inequalities

Swee Hong Chan - Combinatorial atlas for log-concave inequalities

The study of

Combinatorial atlas and their applications: Stanley's poset inequalities (by Swee Hong Chan)

Combinatorial atlas and their applications: Stanley's poset inequalities (by Swee Hong Chan)

D and uh

Combinatorial atlas and their applications: Introduction of combinatorial atlas (by Swee Hong Chan)

Combinatorial atlas and their applications: Introduction of combinatorial atlas (by Swee Hong Chan)

Paper: https://arxiv.org/abs/2203.01533.

Swee Hong Chan: Performing random walks without any randomness (Purdue March 2021)

Swee Hong Chan: Performing random walks without any randomness (Purdue March 2021)

Slides: https://www.math.ucla.edu/~sweehong/PDFs/presentation_Purdue.pdf Abstract: Can one emulate the simple random walk ...

Apr 4, 2025: Swee Hong Chan (Spanning trees and continued fractions)

Apr 4, 2025: Swee Hong Chan (Spanning trees and continued fractions)

Title: Spanning trees and continued fractions Abstract: Consider the set of positive integers representing the number of spanning ...

Swee Hong Chan, Sorting probability for Young diagrams

Swee Hong Chan, Sorting probability for Young diagrams

Slides: https://www.math.ucla.edu/~galashin/seminar/SweeHong_Sorting.pdf Abstract: Can you always find two elements $x$, $y$ ...

Swee Hong Chan: In between random walk and rotor walk (Cornell Dec 2020)

Swee Hong Chan: In between random walk and rotor walk (Cornell Dec 2020)

Slides: Abstract: Can one emulate the simple random walk without actually doing anything random? This talk will be about a ...

10June2022 Combinatorial atlas for log-concave inequalities

10June2022 Combinatorial atlas for log-concave inequalities

Title: Combinatorial atlas for