We study extensions of the Election Isomorphism problem, focused on existence isomorphic subelections. Specifically, we propose Subelection and Maximum Common problems their computational complexity approximability. Using our in experiments, provide some insights into nature several statistical models elections.

The existence of a good theory of Thom isomorphisms in some rational category of mixed Tate motives would permit a nice interpolation between ideas of Kontsevich on deformation quantization, and ideas of Connes and Kreimer on a Galois theory of renormalization, mediated by Deligne’s ideas on motivic Galois groups.

We investigate the computational complexity of the Boolean Isomorphism problem (BI): on input of two Boolean formulas F and G decide whether there exists a permutation of the variables of G such that F and G become equivalent. Our main result is a one-round interactive proof for BI, where the veriier has access to an NP oracle. To obtain this, we use a recent result from learning theory by Bsho...

the concepts of fuzzy semi-ideals of r with respect to h≤r and generalized fuzzy quotient rings are introduced. some properties of fuzzy semiideals are discussed. finally, several isomorphism theorems for generalized fuzzy quotient rings are established.

in this paper, we classify the indecomposable non-nilpotent solvable lie algebras with $n(r_n,m,r)$ nilradical,by using the derivation algebra and the automorphism group of $n(r_n,m,r)$.we also prove that these solvable lie algebras are complete and unique, up to isomorphism.

In this paper, we prove results on the relationship between the complexity of the group and color isomorphism problems. The difficulty of color isomorphism problems is known to be closely linked to the the composition factors of the permutation group involved. Previous works are primarily concerned with applying color isomorphism to bounded degree graph isomorphism, and have therefore focused o...

In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...