-
04
2025/08
第19次JSSC前沿学术沙龙
主办单位：《系统科学与复杂性（英文）》编辑部承办单位：河北师范大学 数学科学学院8:30-8:40 开幕式8:40-8:50 全体照相8:50-9:20 报告1：网络化系统结构辨识(吴晓群，深圳大学)9:20-9:50 报告2：工业物联网的传输-控制联合设计与优化(朱善迎，上海交通大学)9:50-10:20 报告3：面向资源优化和数据安全的系统辨识(郭金，北京科技大学)10:20-10:40 休息10:40-11:10 报告4：Secure Network Function Computation for Linear Functions: Target-Function Security(光炫，南开大学)11:10-11:40 报告5：联合错误数据注入攻击下网络化系统安全性研究(许文盈，东南大学)11:40-12:00 报告6：提升JSSC服务水平，扩大期刊影响力(吴国云，中国科学院数学与系统科学研究院)14:00-14:30 报告7：Minimal Representation of Phase-type Distributions(姚大成，中国科学院数学与系统科学研究院)14:30-15:00 报告8：矩阵哈达玛积的正定性及其在雷达信号处理中的应用(杨在，西安交通大学)15:00-15:30 报告9：量化系统辨识与优化(邵明杰，中国科学院数学与系统科学研究院)15:30-15:50 休息15:50-16:20 报告10：太赫兹三维成像重构模型(王治国，四川大学)16:20-17:20 控制与通信一体化研究圆桌论坛
-
03
2025/08
Advancements in Weighted Incidence Matrix Labelling Methods for Graph Spectral Theory
This reportexplores the development and applications of the $\alpha$-normal labellingmethod and its extension, the $(\alpha, \beta)$-labelling method, in$k$-uniform hypergraphs and graphs. Initially proposed by Linyuan Lu andShoudong Man in their 2016 paper, this method has significantly advanced thestudy of spectral properties in hypergraphs.The$\alpha$-normal labelling method has been extended to the $(\alpha,\beta)$-labelling method, which has been applied to $k$-uniform hypergraphs togain deeper insights into their spectral properties. This method has beeninstrumental in identifying hypergraph structures with minimal spectral radii.Recent researchhas further explored the spectral radius in specific types of hypergraphs, suchas bicyclic uniform hypergraphs, and developed necessary conditions forextremal graph structures. Additionally, the method has been applied todegree-based weighted adjacency matrices in graphs, enabling the determinationof extremal spectral radii for graphs with given order and size.These advancements haveexpanded the theoretical framework of hypergraph and graph spectral theory,providing essential tools for both theoretical analysis and practicalapplications. The continued development of these labelling methods underscorestheir importance and versatility in advancing the field of graph theory.
-
23
2025/07
Оn maximal cliques in Paley graphs, generalised Paley graphs and Peisert graphs
In this talk wewill discuss maximal cliques in Paley graphs, generalized Paley graphs, andPeisert graphs. We will consider some constructions of maximal cliques andtheir geometric interpretation. We will also present some results oneigenfunctions in these graphs.
-
23
2025/07
Construction of divisible design graphs using affine designs
A $k$-regular graphwith $v$ vertices is a {\em divisible design graph with parameters}$(v,k,\lambda_1,\lambda_2,m,n)$ if its vertex set can be partitioned into $m$classes of size $n$ such that any two different vertices from the same classhave $\lambda_1$ common neighbours, and any two vertices from different classeshave $\lambda_2$ common neighbours.Divisible design graphs were introduced by H. Kharaghani and first provided byW.H. Haemers, H. Kharaghani and M. Meulenberg. In particular, the authors haveproposed several constructions of divisible design graphs using variouscombinatorial structures. Some new combinatorial constructions of divisibledesign graphs were later provided by many authors.In this talk, we present twoprolific constructions that produce infinite series of divisible design graphs.Using affine designs for these constructions develops ideas of W.D. Wallis,D.G. Fon-Der-Flaass, and M. Muzychuk.
-
23
2025/07
Complete mappings and orthogonal orthomorphisms of groups
A complete mappingof a finite group $G$ is a permutation $\phi: G\rightarrow G$ such that$x\mapsto x\phi(x)$ is also a permutation. A permutation $\theta:G\rightarrowG$ of a finite group $G$ is an orthomorphism of $G$ if the mapping $x\mapstox^{-1}\theta(x)$ is also a permutation. Two orthomorphisms $\theta$ and $\phi$of $G$ are orthogonal if the mapping $x\mapsto \theta(x)^{-1}\phi(x)$ isbijective. This talk provides a brief introduction to the existence of completemappings and orthogonal orthomorphisms of groups, focusing on their algebraicand extremal aspects. Difference matrices have a close relationship with orthogonalorthomorphisms of groups. It will also give a survey on difference matrices andtheir related topics, such as orthogonal arrays and mutually orthogonal Latinsquares.
-
23
2025/07
The Search for Rainbow 3-term arithmetic progressions: An Inspirational Journey
In this talk, wediscuss the existence of rainbow 3-term arithmetic progressions within3-colorings of various ground sets, including finite intervals, cyclic groups,and general abelian groups. This foundational question -how rainbow structuresemerge under specific density conditions on color classes- has inspired awealth of insights, problems, and generalizations within Rainbow Ramsey Theory.
-
18
2025/07
“丝绸之路”沿线国家农业科教合作概况及展望
“丝绸之路”沿线国家农业科教合作概况及展望
-
18
2025/07
LAZYs基因调控水稻分蘖角度的分子机制
LAZYs基因调控水稻分蘖角度的分子机制
-
15
2025/07
Codes, groups and designs
Theadjacency code of a rank three group contains PBIBDs by construction. When weare lucky we obtain a BIBD also known as 2-design. This is the casefor instance of the one point stabilizer of PSL(2,41) in its action onthe binary QR(41). When we are even luckyer we obtain a 3-design inthe extended code. This is the case of the XQR(41) in length 42. Byconsidering known families of rank 3 groups we obtain in that way 111 2-designand nine 3-designs. The supporting codes are constructed by modularrepresentation theory. ( joint works with Bonnecaze and with Rodrigues). Anothergroup action method applies to isodual ternary codes the automorphism group ofwhich admits two orbits on triples (joint work with Shi and Liu.) Interestingexamples are provided by Generalized Quadratic Residue codes, a family ofabelian codes discussed by van Lint and MacWilliams. Since none of thediscussed designs can be explained by the Assmus-Mattson theorem ortransitivity arguments, all of this work is based on computer calculationsin Magma. Recently a theoretical explanation of the designs in the weight10 codewords of the XQR(41) was provided by Munemasa based on harmonic weightenumerators.
-
15
2025/07
Banach Spaces with the Ball Covering Property
A Banach space is said to have the ball coveringproperty if its unit sphere can be covered by countably many open balls off theorigin. The ball covering property is a property that has close relationshipswith the topological properties and geometric properties of Banach spaces. Inthis talk, we will give a review of the historical literature and present somerecent advances on this topic. Open problems will be proposed, and approacheswill be discussed.
