Related papers: A Note on Nonuniform versus Uniform ACC^k Circuits…

We state results from noncommutative deformation theory of modules over an associative $k$-algebra $A,$ $k$ a field, necessary for this work. We define a set of $A$-modules $\operatorname{aSpec}A$ containing the simple modules, whose…

We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of…

Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…

Probabilistic circuits are a unifying representation of functions as computation graphs of weighted sums and products. Their primary application is in probabilistic modeling, where circuits with non-negative weights (monotone circuits) can…

We study graduated orders over completed group rings of $1$-dimensional admissible $p$-adic Lie groups, and verify the equivariant $p$-adic Artin conjecture for such orders. Following Jacobinski and Plesken, we obtain a formula for the…

A sequence $D=(d_1,d_2,\ldots,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\ldots,v_n$ such that the degree of $v_i$ is $d_i$ for $1\leq i\leq n$. Given a graph theoretical…

An edge of a graph of order $n$ is pancyclic if it lies in a cycle of every length $3,\ldots,n$. A graph of order $n$ is vertex-pancyclic if every vertex lies in a cycle of every length $3,\ldots,n$. Recently, Li and Zhan proved that every…

A theory with a non-compact form-symmetry is described by two closed form fields of degrees k and d-k. Effective theory examples are non-linear electrodynamics, a photon field coupled to a neutron field, and a low energy Goldstone boson. We…

The purpose of this paper is to show the unusual behavior of a number of simple circuits under the effects of post-selection. A useful duality exists between post-selected ensembles and a consistent picture of acausal physics embodying the…

We show that if NC$^1 \neq$ L, then for every element $\alpha$ of the alternating group $A_t$, circuits of depth $O(\log t)$ cannot distinguish between a uniform vector over $(A_t)^t$ with product $= \alpha$ and one with product $=$…

We introduce the class weakly nil clean rings, as rings R in which for every a\in R there exist an idempotent e and a nilpotent q such that a-e-q\in eRa. Every weakly nil clean ring is exchange. Weakly nil clean rings contain pi-regular…

We study corners and fundamental corners of the irreducible representations of the groups G=Spin(n,1) that are not elementary, i.e. that are equivalent to subquotients of reducible nonunitary principal series representations. For even n we…

We give several new lower bounds on size of homogeneous non-commutative circuits. We present an explicit homogeneous bivariate polynomial of degree $d$ which requires homogeneous non-commutative circuit of size $\Omega(d/\log d)$. For an…

In this paper, we study discrepancy questions for spanning subgraphs of $k$-uniform hypergraphs. Our main result is that, for any integers $k \ge 3$ and $r \ge 2$, any $r$-colouring of the edges of a $k$-uniform $n$-vertex hypergraph $G$…

In this paper we consider a family of dynamical systems that we call "arabesques", defined as closed chains of 2-element negative circuits. An $n$-dimensional arabesque system has $n$ 2-element circuits, but in addition, it displays by…

Let $\mathbf D=\bar{\mathbb D}$ be the closed unit disk in $\mathbb C$ and $\mathbf B_n=\bar{\mathbb B_n}$ the closed unit ball in $\mathbb C^n$. For a compact subset $K$ in $\mathbb C^n$ with nonempty interior, let $A(K)$ be the uniform…

We describe a practical method of constructing quantum combinational logic circuits with basic quantum logic gates such as NOT and general $n$-bit Toffoli gates. This method is useful to find the quantum circuits for evaluating logic…

A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity…

The causal structure of a unitary transformation is the set of relations of possible influence between any input subsystem and any output subsystem. We study whether such causal structure can be understood in terms of compositional…

A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called $r$-cyclic if $n=m(k-1)-r+1$. For $r=1$ or $2$, the hypergraph is simply called unicyclic or bicyclic. In this paper we investigate hypergraphs that attain larger…