Archives: Talks

  • Can AI agents ask questions that have never been asked before?

    —

    by

    Abstract I do not know the answer to the question in the title; I think that it is an important question. Examples will be given.

  • Graham’s Conjecture in Graph Pebbling

    —

    by

    Abstract Graph pebbling began as a method to solve zero-sum problems in combinatorial number theory and group theory. Like many "games" that move tokens along the edges of a graph according to various rules (e.g., cops & robbers, zero forcing, power domination, graph burning, etc.), it has grown into a network optimization model in its…

  • Consequences of Exponential Parameter Estimation in Simulation

    —

    by

    Abstract Simulation analysts routinely estimate model parameters from data and then substitute those estimates into subsequent analyses. While this “plug-in” paradigm is nearly universal, its consequences can have significant implications for decision making. We examine these consequences in a collection of stochastic models driven by exponential distributions, where exact finite-sample analysis is possible. Using the…

  • Frobenius

    —

    by

    Abstract This is a test

  • Comparabilty in Bruhat Orders

    —

    by

    Abstract The weak and strong Bruhat orders are fundamental objects in algebraic combinatorics. Both are partial orders on the symmetric group — that is the set of permutations on [n] letters — and can be relatively simply defined in terms of properties of the permutations themselves.  Despite  their central role — with connections to many…

  • On almost cosymplectic generalized (k,μ)′-spaces

    —

    by

    Abstract In this talk, we introduce almost cosymplectic manifolds whose characteristic vector field ξ belongs to a generalized (k, µ)′-nullity distribution involving a certain tensor h′ of type (1,1). If h′ ≠0, we prove that the smooth functions k and µ are uniquely determined by k < 0 and µ = ξ (ln λ )…

  • Ranks of Matrix Factorizations

    —

    by

    Abstract A free resolution of a module over a ring is an approximation of the module in terms of simple building blocks, namely free modules. Several of the most important open problems in commutative algebra concern bounds on the ranks of the free modules appearing in free resolutions. I will discuss one such conjecture involving…

  • A Predictive Model for Combined Oncolytic Virotherapy: Mechanism, Synergy and Optimal Timing

    —

    by

    AbstractI will present a mathematical model of synergistic oncolytic virotherapy combining Vesicular Stomatitis Virus (VSV) and Vaccinia Virus (VV). The model centres on the B18R protein secreted by VV-infected cells, which neutralises interferon-α (IFN-α) and potentiates VSV replication, creating a dynamic ping-pong oncolytic effect between the two viruses. Simulations show that combination therapy clears tumours…

  • Bias-corrected integration of abundance and occupancy data.

    —

    by

    Abstract Data integration synthesizes information from multiple sources to yield a comprehensive understanding of complex systems. By combining diverse data streams, researchers can leverage the unique strengths of different sampling designs while mitigating the inherent limitations of individual surveys. In ecology, this approach is vital for monitoring biodiversity across scales by reconciling contrasting data, such…

  • Directed Graph Models for Recruitment-Based Systems: Solvency Thresholds, Branching Structures, and Contagion Dynamics.

    —

    by

    Abstract Pyramid schemes, Ponzi schemes, multi-level marketing  (MLM) programs, and blessing looms are often described in financial or legal terms, but each also has an underlying mathematical structure. In this talk, we consider these recruitment-based systems primarily as directed graphs. We distinguish between a sponsorship graph, which records who recruited whom and determines compensation-relevant relationships,…