Related papers: A Note on Nonuniform versus Uniform ACC^k Circuits…
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
A tight $k$-uniform $\ell$-cycle, denoted by $TC_\ell^k$, is a $k$-uniform hypergraph whose vertex set is $v_0, \cdots, v_{\ell-1}$, and the edges are all the $k$-tuples $\{v_i, v_{i+1}, \cdots, v_{i+k-1}\}$, with subscripts modulo $\ell$.…
We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler…
We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…
We prove three variations of recent results due to Andrews on congruences for $NT(m,k,n)$, the total number of parts in the partitions of $n$ with rank congruent to $m$ modulo $k$. We also conjecture new congruences and relations for…
We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and…
A solvable quantum $LC$ circuit with charge discreteness is studied. Two discrete spectral branches are obtained: (i) the normal branch corresponding to a charged capacitor with integer effective charge $k=q_{e}n$ ($q_{e}$ elementary…
It is well-known that there exist infinite sequences that are the fixed point of non-uniform morphisms, but not $k$-automatic for any $k$. In this note we show that every $k$-automatic sequence is the image of a fixed point of a {\it…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
For nonautonomous linear difference equations, we introduce the notion of the so-called nonuniform dichotomy spectrum and prove a spectral theorem. Moreover, we introduce the notion of weak kinematical similarity and prove a reducibility…
We present a brief survey of fluctuations and large deviations of particle systems with subextensive growth of the variance. These are called hyperuniform (or superhomogeneous) systems. We then discuss the relation between hyperuniformity…
We show how to construct a non-2-colorable k-uniform hypergraph with (2^(1 + o(1)))^k edges. By the duality of hypergraphs and monotone k-CNF-formulas this gives an unsatisfiable monotone k-CNF with (2^(1 + o(1)))^k clauses
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are…
The structural analysis, i.e., the investigation of the differential-algebraic nature, of circuits containing simple elements, i.e., resistances, inductances and capacitances is well established. However, nowadays circuits contain all sorts…
We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…
We introduce a notion of a uniform structure on the set of all representations of a given separable, not necessarilly commutative $C^*$-algebra $\mathfrak{A}$ by introducing a suitable family of metrics on the set of representations of…
We consider a long but finite (ladder) circuit with alternating connections of resistors in series and parallel and derive an explicit expression for its equivalent resistance as a function of the number of repeating blocks, $R_{\rm…
For quantum computer circuits, it is proposed that they have, besides the presently used compact graphs, an expanded system of subgraphs, in line with the quantum mechanics superposition axiom. The representation of each process by these…