搜索结果: 1-5 共查到“计算数学 Groups X”相关记录5条 . 查询时间(0.125 秒)
Lifting of Characters for Nonlinear Simply Laced Groups
Lifting of Characters Nonlinear Simply Laced Groups
2015/9/28
One aspect of the Langlands program for linear groups is lifting of characters, which relates virtual representations on a group G with those on an endoscopic group for G. The goal of this paper is to...
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS
SANDPILE GROUPS SPANNING TREES DIRECTED LINE GRAPHS
2015/8/14
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose...
Representations of Higher Adelic Groups and Arithmetic
Representations Higher Adelic Groups Arithmetic
2011/1/17
What do we mean by local ? To get an answer to this question let us start from the following two problems.
Counting Method for Multi-party Computation over Non-abelian Groups
Multiparty Passive Adversary Non-Abelian Groups Graph Coloring Neighbor-Avoiding Walk Random Walk
2012/12/3
In the Crypto’07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. The function to be computed is fG(x1, . . . , xn) := x1 · . . . · xn whe...
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Multiparty Computation Passive Adversary Non-Abelian Groups Graph Coloring Percolation Theory
2012/12/3
Recently, Desmedt et al. studied the problem of achieving secure nparty computation over non-Abelian groups. They considered the passive adversary model and they assumed that the parties were only all...