‎The rings considered in this article are commutative with identity which admit at least two maximal ideals‎.  ‎This article is inspired by the work done on the comaximal ideal graph of a commutative ring‎. ‎Let R be a ring‎.  ‎We associate an undirected graph to R denoted by mathcal{G}(R)‎,  ‎whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R)‎, ‎where J(R) is...

In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about compone...

We find characterization for the distinguished varieties in symmetrized polydisc $\mathbb G_n \; (n\geq 2)$ and thus generalize work [\textit{J. Funct. Anal.}, 266 (2014), 5779 -- 5800] on G_2$ by author Shalit. show that a variety $\Lambda$ G_n$ is part of an algebraic curve, which set-theoretic complete intersection, can be represented Taylor joint spectrum $n-1$ commuting scalar matrices sat...

With autonomous vehicles (AV) set to integrate further into regular human traffic, there is an increasing consensus of treating AV motion planning as a multi-agent problem. However, the traditional game theoretic assumption complete rationality too strong for purpose driving, and need understanding driving bounded rational activity through behavioral lens. To that end, we adapt three metamodels...

The intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the unification problem is decidable. We give the first nontrivial lower bound for the problem by showing (our main result) that it is exponential time hard. Furthermore, we show that this holds even...