scholarly journals On rational singularities and counting points of schemes over finite rings

2019 ◽  
Vol 13 (2) ◽  
pp. 485-500 ◽  
Author(s):  
Itay Glazer
Keyword(s):  
Finite Rings ◽  
Rational Singularities ◽  
Counting Points

scholarly journals Sensor Location Problem for Network Traffic Flow Derivation Based on Turning Ratios at Intersection

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Minhua Shao ◽  
Lijun Sun ◽  
Xianzhi Shao
Keyword(s):  
Network Flow ◽  
Location Problem ◽  
Optimal Solution ◽  
Coefficient Matrix ◽  
Sensor Location ◽  
The Road ◽  
Minimum Number ◽  
Flow Conservation ◽  
The Greedy Algorithm ◽  
Counting Points

The sensor location problem (SLP) discussed in this paper is to find the minimum number and optimum locations of the flow counting points in the road network so that the traffic flows over the whole network can be inferred uniquely. Flow conservation system at intersections is formulated firstly using the turning ratios as the prior information. Then the coefficient matrix of the flow conservation system is proved to be nonsingular. Based on that, the minimal number of counting points is determined to be the total number of exclusive incoming roads and dummy roads, which are added to the network to represent the trips generated on real roads. So the task of SLP model based on turning ratios is just to determine the optimal sensor locations. The following analysis in this paper shows that placing sensors on all the exclusive incoming roads and dummy roads can always generate a unique network flow vector for any network topology. After that, a detection set composed of only real roads is proven to exist from the view of feasibility in reality. Finally, considering the roads importance and cost of the sensors, a weighted SLP model is formulated to find the optimal detection set. The greedy algorithm is proven to be able to provide the optimal solution for the proposed weighted SLP model.

scholarly journals Quotient rings of Noetherian module finite rings

1994 ◽  
Vol 121 (2) ◽  
pp. 335-335 ◽  
Author(s):  
A. W. Chatters ◽  
C. R. Hajarnavis
Keyword(s):  
Finite Rings ◽  
Noetherian Module ◽  
Quotient Rings

scholarly journals Public-key cryptosystem based on invariants of diagonalizable groups

2017 ◽  
Vol 9 (1) ◽  
Author(s):  
František Marko ◽  
Alexandr N. Zubkov ◽  
Martin Juráš
Keyword(s):  
Linear Algebra ◽  
Finite Fields ◽  
Number Fields ◽  
Euclidean Algorithm ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Finite Rings

AbstractWe develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).

Finite rings with exactly two maximal subrings

2011 ◽  
Vol 55 (6) ◽  
pp. 46-52 ◽  
Author(s):  
S. S. Korobkov
Keyword(s):  
Finite Rings

scholarly journals Finite rings in which commutativity is transitive

2009 ◽  
Vol 162 (2) ◽  
pp. 143-155 ◽  
Author(s):  
David Dolžan ◽  
Igor Klep ◽  
Primož Moravec
Keyword(s):  
Finite Rings

scholarly journals New quantum codes from dual-containing cyclic codes over finite rings

2016 ◽  
Vol 15 (11) ◽  
pp. 4489-4500 ◽  
Author(s):  
Yongsheng Tang ◽  
Shixin Zhu ◽  
Xiaoshan Kai ◽  
Jian Ding
Keyword(s):  
Cyclic Codes ◽  
Quantum Codes ◽  
Finite Rings

scholarly journals Counting points of fixed degree and given height over function fields

2012 ◽  
Vol 45 (2) ◽  
pp. 283-300 ◽  
Author(s):  
Jeffrey Lin Thunder ◽  
Martin Widmer
Keyword(s):  
Function Fields ◽  
Fixed Degree ◽  
Counting Points
Sign in / Sign up

Export Citation Format

Share Document