Clifiord分析中双正则函数及调和函数在平面上的积分表示

本文研究了取值在Clifiord代数上双正则函数及调和函数在超复平面上积分表示的问题.利用构造核函数的方法,获得了双正则函数及调和函数在超复平面上的积分表示公式,这些结果推广了Clifiord分析中正则函数在超复平面上的积分表示公式.     

An equivariant index for proper actions III: The invariant and discrete series indices

We study two special cases of the equivariant index defined in part I of this series. We apply this index to deformations of ${\mathrm{Spin}}^{\mathrm{c}}$-Dirac operators, invariant under actions by possibly noncompact groups, with possibly noncompact orbit spaces. One special case is an index defined in terms of multiplicities of discrete series representations of semisimple groups, where we assume the Riemannian metric to have a certain product form. The other is an index defined in terms of sections invariant under a group action. We obtain a relation with the analytic assembly map, quantisation commutes with reduction results, and Atiyah–Hirzebruch type vanishing theorems. The arguments are based on an explicit decomposition of ${\mathrm{Spin}}^{\mathrm{c}}$-Dirac operators with respect to a global slice for the action.     

关于4阶极小渐近基的一个结果

设h≥2,若h阶渐近基A的任一真子集均不是h阶渐近基,则称集合A是自然数集N的h阶极小渐近基.为进一步刻画渐近基与极小渐近基之间的关系,本文综合运用自然数的b进制表示理论及分类讨论的方法,证明了存在一个集合是4阶渐近基且其任何子集均不是4阶极小渐近基.     

Minimal dimensions of faithful representations for abelian Lie superalgebras

This paper determines the minimal dimensions of faithful representations for abelian Lie superalgebras of finite dimensions over an algebraically closed field of characteristic zero. In particular, we also obtain the maximal dimensions of abelian subalgebras for the general linear Lie superalgebras.     

Local Clique Covering of Claw‐Free Graphs

A clique covering of a simple graph G is a collection of cliques of G covering all the edges of G such that each vertex is contained in at most k cliques. The smallest k for which G admits a clique covering is called the local clique cover number of G and is denoted by lcc(G). Local clique cover number can be viewed as the local counterpart of the clique cover number that is equal to the minimum total number of cliques covering all edges. In this article, several aspects of the local clique covering problem are studied and its relationships to other well‐known problems are discussed. In particular, it is proved that the local clique cover number of every claw‐free graph is at most , where Δ is the maximum degree of the graph and c is a constant. It is also shown that the bound is tight, up to a constant factor. Moreover, regarding a conjecture by Chen et al. (Clique covering the edges of a locally cobipartite graph, Discrete Math 219(1–3)(2000), 17–26), we prove that the clique cover number of every connected claw‐free graph on n vertices with the minimum degree δ, is at most , where c is a constant.     

Representations of hypergraph states with neural networks

The quantum many-body problem(QMBP) has become a hot topic in high-energy physics and condensed-matter physics. With an exponential increase in the dimensions of Hilbert space, it becomes very challenging to solve the QMBP, even with the most powerful computers. With the rapid development of machine learning, artificial neural networks provide a powerful tool that can represent or approximate quantum many-body states. In this paper, we aim to explicitly construct the neural network representations of hypergraph states. We construct the neural network representations for any k-uniform hypergraph state and any hypergraph state,respectively, without stochastic optimization of the network parameters. Our method constructively shows that all hypergraph states can be represented precisely by the appropriate neural networks introduced in [Science 355(2017) 602] and formulated in [Sci. China-Phys.Mech. Astron. 63(2020) 210312].     

Shall I Work with Them? A Knowledge Graph-Based Approach for Predicting Future Research Collaborations

We consider the prediction of future research collaborations as a link prediction problem applied on a scientific knowledge graph. To the best of our knowledge, this is the first work on the prediction of future research collaborations that combines structural and textual information of a scientific knowledge graph through a purposeful integration of graph algorithms and natural language processing techniques. Our work: (i) investigates whether the integration of unstructured textual data into a single knowledge graph affects the performance of a link prediction model, (ii) studies the effect of previously proposed graph kernels based approaches on the performance of an ML model, as far as the link prediction problem is concerned, and (iii) proposes a three-phase pipeline that enables the exploitation of structural and textual information, as well as of pre-trained word embeddings. We benchmark the proposed approach against classical link prediction algorithms using accuracy, recall, and precision as our performance metrics. Finally, we empirically test our approach through various feature combinations with respect to the link prediction problem. Our experimentations with the new COVID-19 Open Research Dataset demonstrate a significant improvement of the abovementioned performance metrics in the prediction of future research collaborations.     

Computational Abstraction

Representation and abstraction are two of the fundamental concepts of computer science. Together they enable “high-level” programming: without abstraction programming would be tied to machine code; without a machine representation, it would be a pure mathematical exercise. Representation begins with an abstract structure and seeks to find a more concrete one. Abstraction does the reverse: it starts with concrete structures and abstracts away. While formal accounts of representation are easy to find, abstraction is a different matter. In this paper, we provide an analysis of data abstraction based upon some contemporary work in the philosophy of mathematics. The paper contains a mathematical account of how Frege’s approach to abstraction may be interpreted, modified, extended and imported into type theory. We argue that representation and abstraction, while mathematical siblings, are philosophically quite different. A case of special interest concerns the abstract/physical interface which houses both the physical representation of abstract structures and the abstraction of physical systems.