scholarly journals CATEGORICAL COMPLEXITY

2020 ◽  
Vol 8 ◽  
Author(s):  
SAUGATA BASU ◽  
UMUT ISIK
Keyword(s):  
Complexity Theory ◽  
Boolean Functions ◽  
Circuit Complexity ◽  
Polynomial Rings ◽  
Common Interest ◽  
Vector Spaces ◽  
Topological Spaces ◽  
Complexity Classes ◽  
Graded Algebras ◽  
Projective Varieties

We introduce a notion of complexity of diagrams (and, in particular, of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several examples of this new definition in categories of wide common interest such as finite sets, Boolean functions, topological spaces, vector spaces, semilinear and semialgebraic sets, graded algebras, affine and projective varieties and schemes, and modules over polynomial rings. We show that on one hand categorical complexity recovers in several settings classical notions of nonuniform computational complexity (such as circuit complexity), while on the other hand it has features that make it mathematically more natural. We also postulate that studying functor complexity is the categorical analog of classical questions in complexity theory about separating different complexity classes.

scholarly journals Homological epimorphisms, homotopy epimorphisms and acyclic maps

2020 ◽  
Vol 32 (6) ◽  
pp. 1395-1406
Author(s):  
Joseph Chuang ◽  
Andrey Lazarev
Keyword(s):  
Wide Class ◽  
Topological Spaces ◽  
Loop Spaces ◽  
Graded Algebras ◽  
Differential Graded Algebras ◽  
Algebraic Description ◽  
Acyclic Map ◽  
Induced Maps

AbstractWe show that the notions of homotopy epimorphism and homological epimorphism in the category of differential graded algebras are equivalent. As an application we obtain a characterization of acyclic maps of topological spaces in terms of induced maps of their chain algebras of based loop spaces. In the case of a universal acyclic map we obtain, for a wide class of spaces, an explicit algebraic description for these induced maps in terms of derived localization.

scholarly journals Newel-pseudotopologiese vektorruimtes

1999 ◽  
Vol 18 (3) ◽  
pp. 89-93
Author(s):  
M. A. Muller
Keyword(s):  
Vector Spaces ◽  
Topological Spaces ◽  
Topological Vector Spaces

Pseudo-topological spaces (i.e. limit spaces) were defined by Fischer in 1959. In this paper the theory of fuzzy pseudo-topological spaces is applied to vector spaces. We introduce the concept of boundedness in fuzzy pseudo-topological vector spaces.

scholarly journals M – STAR – Irresolute Topological Vector Spaces

2021 ◽  
Vol 7 ◽  
pp. 20-36
Author(s):  
Raja Mohammad Latif
Keyword(s):  
Vector Space ◽  
Extreme Point ◽  
Topological Vector Space ◽  
Convex Subset ◽  
Hausdorff Space ◽  
Vector Spaces ◽  
Topological Spaces ◽  
Topological Vector Spaces ◽  
New Class

In 2016 A. Devika and A. Thilagavathi introduced a new class of sets called M*-open sets and investigated some properties of these sets in topological spaces. In this paper, we introduce and study a new class of spaces, namely M*-irresolute topological vector spaces via M*-open sets. We explore and investigate several properties and characterizations of this new notion of M*-irresolute topological vector space. We give several characterizations of M*-Hausdorff space. Moreover, we show that the extreme point of the convex subset of M*-irresolute topological vector space X lies on the boundary.

On Hardware Implementation of Balanced S-boxes

2021 ◽  
Vol 12 (1) ◽  
pp. 8-20
Author(s):  
E. A. Kurganov ◽  
Keyword(s):  
Boolean Functions ◽  
Hardware Implementation ◽  
Circuit Complexity ◽  
Lookup Table ◽  
Synthesis Methods ◽  
Main Indicator ◽  
Non Linear ◽  
Symmetric Ciphers ◽  
Depth And Complexity ◽  
Selection Of

An S-box is a non-linear transformation that takes n bits as input and returns m bits. This transformation is most easily represented as a nm lookup table. Most often, only balanced S-boxes are used in cryptography. This means that the number of input bits is equal to the number of output bits. The S-box is an important part of most symmetric ciphers. The selection of the correct substitution makes the link between the key and the ciphertext more complex (non-linear), which makes it much more difficult to hack. This paper deals with a hardware implementation of S-boxes. This implementation can be realized by using logical conjunction, disjunction, negation and delay blocks. The main indicator of productivity of such implementations is a circuit depth, namely the maximum length of a simple way of the circuit and a circuit complexity, namely the quantity of logic elements (negation elements are not taken into account). The article considers the standard synthesis methods (based on DNF, Shannon, Lupanov), proposes a new algorithm to minimize the complexity of an arbitrary Boolean functions system and a way to reduce the complexity of the circuit obtained after simplification by the ESPRESSO algorithm of DNF of the function related to the output of the S-box. To compare the efficiency of the methods, the C++ program was created that generates a circuit in the Verilog language. The estimates of depth and complexity are obtained for the schemes produced as a result of the programs operation. The article ends with a comparison of the efficiency of S-box schemes of known cryptographic standards obtained as the output of the program (with each other and with the result of the Logic Friday program).

scholarly journals Incremental FPT Delay

Algorithms ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 122
Author(s):  
Arne Meier
Keyword(s):  
Computational Complexity ◽  
Complexity Theory ◽  
Complexity Classes ◽  
Computational Complexity Theory ◽  
Function Classes ◽  
Classical Setting ◽  
Classical Function ◽  
Multivalued Functions ◽  
Relationship Of ◽  
The Relationship

In this paper, we study the relationship of parameterized enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for incremental fpt-time in terms of exponent slices and show how they interleave. Furthermore, we define several parameterized function classes and, in particular, introduce the parameterized counterpart of the class of nondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist, TFNP, known from Megiddo and Papadimitriou (TCS 1991). We show that this class TF(para-NP), the restriction of the function variant of NP to total functions, collapsing to F(FPT), the function variant of FPT, is equivalent to the result that OutputFPT coincides with IncFPT. In addition, these collapses are shown to be equivalent to TFNP = FP, and also equivalent to P equals NP intersected with coNP. Finally, we show that these two collapses are equivalent to the collapse of IncP and OutputP in the classical setting. These results are the first direct connections of collapses in parameterized enumeration complexity to collapses in classical enumeration complexity, parameterized function complexity, classical function complexity, and computational complexity theory.

Maximality in effective topology

1983 ◽  
Vol 48 (1) ◽  
pp. 100-112 ◽  
Author(s):  
Iraj Kalantari ◽  
Anne Leggett
Keyword(s):  
Topological Space ◽  
Boolean Algebras ◽  
Vector Spaces ◽  
Topological Spaces ◽  
Mathematical Structures ◽  
Topological Vector Spaces ◽  
Linear Orderings ◽  
Recursively Enumerable ◽  
Countable Basis ◽  
Effective Analysis

In this paper we continue the study of the structure of the lattice of recursively enumerable (r.e.) open subsets of a topological space. Work in this approach to effective topology began in Kalantari and Retzlaff [5] and continued in Kalantari [2], Kalantari and Leggett [3] and Kalantari and Remmel [4]. Studies in effectiveness of results in structures other than integers began with the work of Specker [17] and Lacombe [8] on effective analysis.The renewed activity in the study of the effective content of mathematical structures owes much to Nerode's program and Metakides' and Nerode's [11], [12] work on vector spaces and fields. These studies have been extended by Kalantari, Remmel, Retzlaff, Shore and Smith. Similar studies on the effective content of other mathematical structures have been conducted. These include work on topological vector spaces, boolean algebras, linear orderings etc.Kalantari and Retzlaff [5] began a study of effective topological spaces by considering a topological space with a countable basis ⊿ for the topology. The space X is to be fully effective; that is, the basis elements are coded into ω and the operations of intersection of basis elements and the relation of inclusion among them are both computable. An r.e. open subset of X is then represented as the union of basic open sets whose codes lie in an r.e. subset of ω.

ON SOME STANDARD GRADED ALGEBRAS IN MODULAR INVARIANT THEORY

2013 ◽  
Vol 13 (01) ◽  
pp. 1350080
Author(s):  
S. K. PATTANAYAK
Keyword(s):  
Galois Field ◽  
Polynomial Rings ◽  
Indecomposable Representation ◽  
Modular Invariant ◽  
Graded Algebras ◽  
Finite Dimensional Representation ◽  
Finite Dimensional ◽  
Projective Normality ◽  
A Finite Group ◽  
Finite Linear

For a finite-dimensional representation V of a finite group G over a field K we denote the graded algebra R ≔ ⨁d≥0 Rd; where Rd ≔ ( Sym d∣G∣V*)G. We study the standardness of R for the representations [Formula: see text], [Formula: see text], and [Formula: see text], where Vn denote the n-dimensional indecomposable representation of the cyclic group Cp over the Galois field 𝔽p, for a prime p. We also prove the standardness for the defining representation of all finite linear groups with polynomial rings of invariants. This is motivated by a question of projective normality raised in [S. S. Kannan, S. K. Pattanayak and P. Sardar, Projective normality of finite groups quotients, Proc. Amer. Math. Soc.137(3) (2009) 863–867].

scholarly journals Bosons vs. Fermions – A computational complexity perspective

2021 ◽  
Vol 43 (suppl 1) ◽  
Author(s):  
Daniel Jost Brod
Keyword(s):  
Computational Complexity ◽  
Complexity Theory ◽  
Undergraduate Students ◽  
Quantum Systems ◽  
Polynomial Hierarchy ◽  
Complexity Classes ◽  
Computational Power ◽  
Linear Optics ◽  
Computational Complexity Theory ◽  
Classical Computer

Recent years have seen a flurry of activity in the fields of quantum computing and quantum complexity theory, which aim to understand the computational capabilities of quantum systems by applying the toolbox of computational complexity theory. This paper explores the conceptually rich and technologically useful connection between the dynamics of free quantum particles and complexity theory. I review results on the computational power of two simple quantum systems, built out of noninteracting bosons (linear optics) or noninteracting fermions. These rudimentary quantum computers display radically different capabilities—while free fermions are easy to simulate on a classical computer, and therefore devoid of nontrivial computational power, a free-boson computer can perform tasks expected to be classically intractable. To build the argument for these results, I introduce concepts from computational complexity theory. I describe some complexity classes, starting with P and NP and building up to the less common #P and polynomial hierarchy, and the relations between them. I identify how probabilities in free-bosonic and free-fermionic systems fit within this classification, which then underpins their difference in computational power. This paper is aimed at graduate or advanced undergraduate students with a Physics background, hopefully serving as a soft introduction to this exciting and highly evolving field.

Sign in / Sign up

Export Citation Format

Share Document