学术报告公告：The asymptotic existence of designs having a nesting: an application of a hypergraph matching theorem

学术报告公告

The asymptotic existence of designs having a nesting: an application of a hypergraph matching theorem

一、报告主题：The asymptotic existence of designs having a nesting: an application of a hypergraph matching theorem

二、主 讲 人：冯弢，教授，博士生导师，主要研究领域：组合设计及其在编码密码中的应用。

三、报告时间：2025年6月13日下午15:00

四、报告地点：明达楼（办公楼）D2423室

五、报告简介：

The asymptotic result for (v, k, λ)-designs having a nesting will be established by employing a tool, provided by Delcourt and Postle, on A-perfect matchings of bipartite hypergraph. Using the same technique, the generalized Novak’s conjecture is confirmed in an asymptotic sense.

主办：数理学院      

2025年6月13日