Related papers: A Note on Nonuniform versus Uniform ACC^k Circuits…
Experimental observations of an almost symmetric electronic circuit show complicated sequences of bifurcations. These results are discussed in the light of a theory of imperfect global bifurcations. It is shown that much of the dynamics…
In a recent paper (Phys. Rev. A 90, 022316 (2014) ), Goyeneche et al. established a link between the combinatorial notion of orthogonal arrays and k-uniform states and present open issue. (B) Find for what N there are 3-uniform states of…
A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorphism with two equally sized vertex orbits. There are four…
Quantum circuit equivalence checking asks whether two circuits implement the same unitary. It guarantees compiler correctness and safe optimization, yet most existing approaches scale exponentially with the number of qubits or the circuit…
For a given $\pi=(\pi_0, \pi_1,..., \pi_k) \in \{0, 1, *\}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V, E)$ has a partition $(V_1, V_2)$ of the vertex set so that for all $X \subseteq V$ of size $k$, $X \in E$…
Implicit computational complexity is a lively area of theoretical computer science, which aims to provide machine-independent characterizations of relevant complexity classes. % for uniformity with subsequent uses >> 1960s (but feel free to…
In this paper we introduce the notion of nonlinear resistance forms. We define a $1$-parameter family of nonlinear resistance metrics and show their additivity over serial circuits. Moreover, we prove that resistance forms and…
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…
One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the following decision problems: Is it possible to determine…
The necessary and sufficient conditions are given for a sequence of complex numbers to be the periodic (or antiperiodic) spectrum of non-self-adjoint Dirac operator.
For any ring \(R\), some characterizations are obtained for unit regular elements in a corner ring \(eRe\) in terms of unit regular elements in \(R\). \noindent {\bf Key Words}: von Neumann regular rings, unit regular rings, corner rings,…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
For a commutative noetherian ring A, we compare the support of a complex of A-modules with the support of its cohomology. This leads to a classification of all full subcategories of A-modules which are thick (that is, closed under taking…
Two $k$-uniform hypergraphs are said to be cospectral (E-cospectral), if their adjacency tensors have the same characteristic polynomial (E-characteristic polynomial). A $k$-uniform hypergraph $H$ is said to be determined by its spectrum,…
We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…
Two integral quadratic unit forms are called strongly Gram congruent if their upper triangular Gram matrices are Z-congruent. The paper gives a combinatorial strong Gram invariant for those unit forms that are non-negative of Dynkin type A,…
We extend existing results for the Nielsen complexity of scalar primaries and spinning primaries in four dimensions by including supersymmetry. Specifically, we study the Nielsen complexity of circuits that transform a superconformal…
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k^2 4^k clauses, and on the other hand, any linear k-CNF formula with at most…
In this article, we prove that a complex cone is a set of injectivity for the twisted spherical means for the class of all continuous functions on $\mathbb C^n$ as long as it does not completely lay on the level surface of any bi-graded…
We prove that entropy map is upper semi-continuous for C1 nonuniformly hyperbolic systems with domination, while it is not true for C1+alpha nonuniformly hyperbolic systems in general. This goes a little against a common intuition that…