-
19
2026/01
2026国家自然科学基金申请专题培训会
国家自然科学基金政策解读、资助态势、申请书撰写
-
17
2026/01
2026组合设计理论研究生创新论坛
1月17日上午8:20-8:40 开幕式及合影8:40-9:00 范翠玲（西南交通大学）面向非对称信道的组合对象应用研究9:00-9:20 王小苗（宁波大学）q-ary (1,k)-overlap-free codes9:20-9:40 李向前（首都经济贸易大学）Latin square-driven neural networkperformance optimization and applications9:40-10:00 陈光周（河南师范大学）Zarankiewicz numbers from Packings10:20-10:40 卢虹（康复大学）Further results on large sets plus ofpartitioned incomplete Latin squares10:40-11:00 刘艳（河北科技大学）导出设计可分解的斯坦纳四元系的构造11:00-11:20 明新月（北京交通大学）几类组合构型的存在性问题11:20-11:40 张子安（北京交通大学）CBIBD and 1-rotational BIBD with block size41月17日下午14:00-14:20 王立冬（中国人民警察大学）Age of information for periodic statusupdates under matrix based scheduling14:20-14:40陈静远（广西师范大学）Theexistence of 32-decomposable super-simple (4, 6)-GDDs of type gu14:40-15:00赵静慧（河北师范大学）Mixedcovering arrays on hypergraphs15:00-15:20 余仕康（北京交通大学）Complete mappings stabilizing a subgroupand their parities15:20-15:40 于丽影（苏州大学）Constructions of optimal sparse r-disjunctmatrices via packings16:00-16:20臧亚娟（河北师范大学）Genuinely quantum solutions of orthogonalSudoku squares16:20-16:40 申红莲（衡水学院）Color image encryption scheme combining a2D hyperchaotic Sin-Henon system and the division algorithm16:40-17:00 张愉媛（南京师范大学）On the possible cardinalities of quantumLatin squares17:00-17:20 刘恒瑞（北京交通大学）Perfect difference families, perfectsystems of difference sets and their applications17:20-17:40 王晓冉（北京交通大学）On recursive constructions for t-designsover finite fields1月18日上午8:20-8:40 方剑英（江西师范大学）On the minimum distance of two classes ofprimitive BCH codes8:40-9:00 闫茜茜（天津理工大学）The support designs of several families oflifted linear codes9:00-9:20 郑豪（北京物资学院）大语言模型(LLMs)在解决组合设计问题中的学习与探索9:20-9:40 刘双庆（苏州科技大学）Combinatorial constructions of optimallow/constant power error-correcting cooling codes9:40-10:00 谭雨丽（北京交通大学）Steiner quadruple systems with minimumcolorable derived designs:constructions and applications10:20-10:40 王长远（枣庄学院）Doubly resolvable group divisible designswith block size 3 and group size 3 and index 110:40-11:00 蒋领（上海海洋大学）New bounds and algorithmic constructions ofq-ary secure codes with list decoding for arbitrary q11:00-11:20 马丽君（河北石油职业技术大学）On perfect balanced Rainbow-Free coloringsand complete colorings of projective spaces11:20-11:40 蓝连涛（华南农业大学）Cyclic constant-weight codes1月18日下午14:00-14:20 冯雅南（石家庄铁道大学）A class of LDPC codes based on attenuatedsymplectic space14:20-14:40 付祎（河北师范大学）Geometrical construction of k-optimallocally repairable codes14:40-15:00 高会珍（河北师范大学）Geometric difference families and relatedvariable-weight geometric orthogonal codes15:00-15:20 周静（河北师范大学）1 1/2-designs based on symplectic geometryover finite fields15:20-15:40 孙梦（河北师范大学）Weights of a class of projective geometrycodes15:40-16:00 牛晓东（河北师范大学）Bounds of repeated row orthogonal array16:00-16:20 闭幕式
-
16
2026/01
Degree powers sum of graphs
We study the maximum of the degreepowers sum $e_p(G) = \sum_{v \in V(G)} d(v)^p$ in two settings. First, forsufficiently large bowtie-free graphs $G$ of order $n$, we asymptoticallydetermine $ex_p(n, F_2)$ and characterize the extremal structure: itessentially consists of a complete bipartite graph with a single edge addedinside the smaller part. Second, among all unicyclic graphs of order $n$ anddiameter $d \ge 1$, we prove that the maximum of $e_p(G)$ for $p \ge 2$ isuniquely attained by an explicit family $H^d$. These results extend the Turán-type problem of degree powers sum to both forbidden subgraph anddiameter-constrained contexts.
-
16
2026/01
Spectral extremal problem for the odd prism
The spectral Tur\'an number $\spex(n, F)$ denotes the maximumspectral radius $\lambda(G)$ of an $F$-free graph $G$ of order $n$. In thistalk, we will first introduce some relevant background and then present our results on $\spex\left(n, C_{2k+1}^{\square}\right)$ for sufficiently large $n$,establishing the unique extremal graph. Here, $C_{2k+1}^{\square}$ is the oddprism, which is the Cartesian product $C_{2k+1} \square K_2$, where theCartesian product $G \square F$ has vertex set $V(G) \times V(F)$, and edgesbetween $(u_1,v_1)$ and $(u_2,v_2)$ if either $u_1 = u_2$ and $v_1v_2 \inE(F)$, or $v_1 = v_2$ and $u_1u_2 \in E(G)$.
-
16
2026/01
Bounds on the combinatorial Laplacian spectral radius for simplicial complexes
Let X be a pure K+1-dimensional simplicial complex with orientation k,and s1 the k-up Laplacian spectral radius. In this talk, we investigate theupper and lower bounds on s1. On the one hand, we give an upper bound on s1. Moreover,if X is k+1-path connected, then characterize equality case. This generalizessome bounds on graph Laplacian to higher dimensions. On the other hand, we givea new lower bound on s1. This improves the lower bound given by Duval andReiner (2002). As a corollary, we also derive a lower bound for s1 in terms ofthe k+1-diameter d of X, which not only strengthens the previously known boundfor graphs (i.e., the case k=0), but also generalizes it to higher dimensions.
-
19
2026/01
“大外真知讲坛”第29讲 外语教学的几个关键问题
新的一轮课程实施以来，专家对于实施英语课程标准的路径、方法产生歧义，小学与初中英语教师对如何教学也提出诸多困惑。这些分歧与困惑涉及外语教学的几个关键问题：学校环境下外语学习的规律；核心素养的外在特点与形成过程；如何设计教材以满足学习者需求；教学以何种路径做为内容组织方式；如何认识语言体系及其运用。报告将讨论这几个关键问题并就外语学习的规律、如何通过外语教育实现发展核心素养的目标、如何分析教材、如何组织课堂教学活动以及如何认识语言体系的等问题展开讨论。
-
18
2026/01
文苑大讲堂2026年第3讲： 繁花着锦、臻于至善 ——粤方言文化对共同语文化的充实和丰赡 （周末专家河北行）
语言是文明的载体，也是文化的核心组成部分，汉语自诞生以来始终负载汉文化，对汉文化的赓续和发展发挥着无以替代的作用。汉民族共同语（历史上称通语，今称国家通用语言）对汉语各方言的发展起着规范引领的作用，在长期的共同发展中，汉民族共同语与各地方言良性互动，前者遵循“择优吸纳，博采众长—审慎引入，充实主体—树立标准，规范各方”的原则对后者施加影响；各方言，一方面在一定的空间内充分彰显自身的活力，一方面也从不同的角度为共同语的发展和壮大做着各自的贡献。民族共同语和方言始终良性互动，深刻地影响彼此。近代以来中外人士关于民族共同语和方言词汇的研究，对共同语文化和方言文化的和谐互动起着推动作用，学人们词汇的表率使用和优秀辞书的编纂具有重要的资源价值，对汉民族共同语资源建设和共同语词汇近现代以来的长足发展尤有重要的价值和意义。
-
20
2026/01
国家自然科学基金申请经验交流——科研思路和科研方法
国家自然科学基金申请经验交流科研思路和科研方法
-
13
2026/01
磁致伸缩新现象
利用磁电耦合效应研究磁致伸缩效应新机制。
-
14
2026/01
国家自然科学基金申请经验交流——以研立题，以行践知
1.对标评议要点2.分享撰写体会3.细节决定成败4.制胜之道
