-
30
2026/04
Some open positivity problems in combinatorics
Many open problems or conjectures in combinatorics may have the deep connections between combinatorics and other fields of mathematics. In this talk, we will introduce some interesting open problems in combiantorics.
-
30
2026/04
新时代全面深化改革的历史方位及特点
新时代全面深化改革的历史方位及特点。
-
30
2026/04
河北师范大学校友“求真”讲坛（四）关于新时代文化强国建设的若干问题
关于新时代文化强国建设的若干问题。
-
28
2026/04
Combinatorial Geometry of Point Sets (XII)
This lecture develops quantitative bounds for the number of simplices containing a given point, beginning with estimates for m(a,X) and m^*(a,X) then presenting probabilistic constructions based on random points in the Euclidean unit ball. It also reviews supporting linear-algebraic tools such as matrix multiplication and tensor products, connects these tools to geometric covering and hyperplane-counting problems, and finally begins a linear-algebraic proof of Tverberg’s Theorem using partitions and carefully chosen auxiliary vectors.
-
30
2026/04
物理学院人才招聘暨青年学者论坛
冯源（中国科学技术大学）：离轴冕照射下的相对论吸积盘反射李晓燕（厦门大学）：伽马暴中心黑洞超吸积的相关观测研究涂中豪（中国科学院理论物理研究所）：基于统一微观物态的多信使多波段天文学研究张浩洋（云南大学）：黑洞吸积系统的时域特性苏天昊（贵州大学）：基于LAMOST、TESS、Kepler和FAST数据研究特殊恒星的磁活动赵杰（中国科学院理论物理研究所）：原子核结构及其反应动力学朱永皓（中国科学院半导体研究所）：非平衡载流子动力学和结构相变刘可焓（山东大学）：低维材料层间耦合诱导新奇物质态
-
30
2026/04
Power monoids and their arithmetic
Let $H$ be a unit-cancellative commutative monoid (written multiplicatively) and let $H^{\times}$ be its unit group. Then $H$ is called \textit{atomic} if every nonunit of $H$ is a finite product of atoms of $H$.For each $a \in H$, let $\mathsf{L}(a)$ be the set of all integers $n \ge 0$ such that $a$ is a product of $n$ atoms of $H$, where an \textit{atom} is a nonunit that does not factor as a product of two nonunits; we call $\mathsf L(a)$ the \textit{length set} of $a$ (in $H$). Let $\mathcal{L}(H)$ be the family of all nonempty length sets in $H$; we call $\mathcal L(H)$ the \textit{system of length sets} of $H$. We say that $H$ is a BF-monoid if $\mathsf L(a)$ is finite and nonempty for each $a \in H$, in which case\[\mathcal{L}(H) \subseteq \{\{0\}, \{1\}\}\cup\{L\subseteq\mathbb{N}_0: 1 \le |L| <\infty \text{ and } \min L \geq 2\}.\]We say that $H$ has \textit{full system of length sets} if $H$ is a BF-monoid and the above inclusion holds as an equality. Furthermore, $H$ is \textit{fully elastic} if $H$ is atomic and, for each rational number $r\geq 1$ smaller than\[\rho(H) := \sup\left\{\frac{\sup\mathsf{L}(a)}{\min\mathsf{L}(a)}: a\in H\setminus H^{\times}\right\},\]there is a nonunit $b \in H$ such that $r = \max\mathsf{L}(b)/\min\mathsf{L}(b)$; we call $\rho(H)$ the \textit{elasticity} of $H$. Note that, if $H$ has full system of length sets, then $H$ is fully elastic.It is an active research topic in factorization theory to identify monoids with full system of length sets. For example, it was shown by F. Kainrath that block monoids of infinite abelian groups have full system of length sets. Furthermore, S. Frisch proved that the same is true for the monoid of nonzero elements of the ring of integer-valued polynomials. Let\[\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0) = \{A \subseteq \mathbb{N}_0: 0\in A\textnormal{ and }A\textnormal{ is finite}\},\]and for all $A, B \in \mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$, set $A+B=\{a+b\mid a\in A,b\in B\}$. Then $(\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0),+)$ is a unit-cancellative commutative monoid, called the reduced finitary power monoid of $\mathbb{N}_0$. There is a recent (and still open) conjecture of Fan and Tringali, which states that $\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ has full system of length sets.We offer further evidence for the validity of this conjecture. In particular, we show that $\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ is fully elastic, and we provide a wide collection of length sets of $\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$. For instance, we show that all nonempty finite arithmetical progressions $L$ of length $n\geq 2$ with $\min L\geq 2n$ are length sets. We also outline the limitations of our approach and discuss a potential improvement.
-
29
2026/04
当AI回归神经元本质：一种低能耗、可解释的新智能路径
以ChatGPT, DeepSeek为代表的大模型虽在多领域取得突破，但其高能耗问题日益凸显，“小型化”仍未从根本上解决效率与性能的矛盾。本报告从“回归神经元本质”的视角出发，探索一种兼具低能耗与可解释性的智能新路径。基于生物可信的树突状神经元结构，我们提出树突状学习理论，构建面向宽度结构的单神经元学习模型，并结合优化算法实现高效学习机制。在此基础上，系统分析其计算能力与学习性能，并在复杂数据任务中验证其有效性。结果表明，该方法在降低计算成本的同时，具备良好的性能与可解释性，为下一代智能模型提供了新的方向。
-
27
2026/04
周末专家河北行暨化学化工创新前沿与交叉融合学术活动：面向超高清显示的OLED发光材料与器件
超高清显示技术的进步使我们的“视”界变得愈发清晰可见、绚丽多彩。研发满足BT.2020广色域标准的OLED材料与器件已成为推动OLED显示产业升级的关键。本报告面向超高清显示的OLED发光材料与器件，将从窄光谱有机发光材料的合成策略、抑制聚集态发光淬灭、发光的激发态调控等方面介绍近几年的研究进展。
-
30
2026/04
现代舞与中国文化的关系
纵观历史长河，在中西方文明的碰撞中一直闪耀着现代舞核心观念的光芒。本次讲座从介绍现代舞的三大艺术特征：个性、原创性和时代性，借用人物与事件例证出发，在丰富的图片和视频当中生动地讲述现代舞和当代中国生活思潮的共通互融。
-
25
2026/04
2026年粒计算与智能信息处理学术研讨会——“AI背景下的计算机学科发展”主题论坛
2026年粒计算与智能信息处理学术研讨会——“AI背景下的计算机学科发展”主题论坛
