Search this site
Embedded Files
Skip to main content
Skip to navigation
ISMaRT
Home
Current Projects
Exploring Random Matrices
Is the "Three points for a win" rule actually efficient?
Lattices in Topological Data Analysis
Mitigating Barren Plateaus in Variational Quantum Algorithms
Monochromatic covers of edge-colored graphs
Simplicial complexes forcing failure of the weak Lefschetz property
Past Projects
Extraction of Electricity from Water – Modelling and Optimization
Monochromatic partitionings of edge-colored graphs
Rainbow trees
Random Points of Shapes in Space
Trail Trap on Cubic Hamiltonian Graphs
Unlocking the Secrets of Shape Optimization
Car-following
Computations of quantum eigenstates via deep neural networks
Control theory
Coxeter groups and extreme monomial ideals
Deep Neural Networks
Edge ideals
Equilibria of a time-inconsistent Markov decision processes
Food chains (2020)
Food chains (2021)
Frobenius problem
Geodesics
Gradient descent
Happy Numbers
Infinitesimal Symmetries
Kemeny's Constant
Machine learning
Matching
Maximal independent sets in grid-like graphs
Metric Dimension
Packing
Planar Turan number of {C4, C5}
Quantum groups
Random Set Zero Forcing
Rearrangements of infinite series
Semidiscrete FEM
Shape of a Drum
Turbulent Flows
Vaccination
Volume subsets
What is the fastest route down a hill?
Zero forcing
Applications
ISMaRT
Home
Current Projects
Exploring Random Matrices
Is the "Three points for a win" rule actually efficient?
Lattices in Topological Data Analysis
Mitigating Barren Plateaus in Variational Quantum Algorithms
Monochromatic covers of edge-colored graphs
Simplicial complexes forcing failure of the weak Lefschetz property
Past Projects
Extraction of Electricity from Water – Modelling and Optimization
Monochromatic partitionings of edge-colored graphs
Rainbow trees
Random Points of Shapes in Space
Trail Trap on Cubic Hamiltonian Graphs
Unlocking the Secrets of Shape Optimization
Car-following
Computations of quantum eigenstates via deep neural networks
Control theory
Coxeter groups and extreme monomial ideals
Deep Neural Networks
Edge ideals
Equilibria of a time-inconsistent Markov decision processes
Food chains (2020)
Food chains (2021)
Frobenius problem
Geodesics
Gradient descent
Happy Numbers
Infinitesimal Symmetries
Kemeny's Constant
Machine learning
Matching
Maximal independent sets in grid-like graphs
Metric Dimension
Packing
Planar Turan number of {C4, C5}
Quantum groups
Random Set Zero Forcing
Rearrangements of infinite series
Semidiscrete FEM
Shape of a Drum
Turbulent Flows
Vaccination
Volume subsets
What is the fastest route down a hill?
Zero forcing
Applications
More
Home
Current Projects
Exploring Random Matrices
Is the "Three points for a win" rule actually efficient?
Lattices in Topological Data Analysis
Mitigating Barren Plateaus in Variational Quantum Algorithms
Monochromatic covers of edge-colored graphs
Simplicial complexes forcing failure of the weak Lefschetz property
Past Projects
Extraction of Electricity from Water – Modelling and Optimization
Monochromatic partitionings of edge-colored graphs
Rainbow trees
Random Points of Shapes in Space
Trail Trap on Cubic Hamiltonian Graphs
Unlocking the Secrets of Shape Optimization
Car-following
Computations of quantum eigenstates via deep neural networks
Control theory
Coxeter groups and extreme monomial ideals
Deep Neural Networks
Edge ideals
Equilibria of a time-inconsistent Markov decision processes
Food chains (2020)
Food chains (2021)
Frobenius problem
Geodesics
Gradient descent
Happy Numbers
Infinitesimal Symmetries
Kemeny's Constant
Machine learning
Matching
Maximal independent sets in grid-like graphs
Metric Dimension
Packing
Planar Turan number of {C4, C5}
Quantum groups
Random Set Zero Forcing
Rearrangements of infinite series
Semidiscrete FEM
Shape of a Drum
Turbulent Flows
Vaccination
Volume subsets
What is the fastest route down a hill?
Zero forcing
Applications
Applications for Spring 2026 are closed.
Applications for Spring 2027 will start in Fall 2026.
Google Sites
Report abuse
Google Sites
Report abuse