相关论文: Logical Characterization of Algebraic Circuit Clas…

In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of…

In this paper we give a characterization of both Boolean and arithmetic circuit classes of logarithmic depth in the vein of descriptive complexity theory, i.e., the Boolean classes $\textrm{NC}^1$, $\textrm{SAC}^1$ and $\textrm{AC}^1$ as…

Ado's Theorem had been extended to principal ideal domains independently by Churkin and Weigel. They demonstrated that if $R$ is a principal ideal domain of characteristic zero and $\mathfrak{L}$ is a Lie algebra over $R$ which is also a…

Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…

Comparator circuit model was originally introduced by Mayr and Subramanian (1992) (and further studied by Cook, Filmus and Le (2012)) to capture problems which are not known to be P-complete but still not known to admit efficient parallel…

We study the class $\textrm{AC}^0$ of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates. No model-theoretic characterization for arithmetic circuit classes is…

Arithmetic circuits (AC) are circuits over the real numbers with 0/1-valued input variables whose gates compute the sum or the product of their inputs. Positive AC -- that is, AC representing non-negative functions -- subsume many…

The past decade has seen a significant interest in learning tractable probabilistic representations. Arithmetic circuits (ACs) were among the first proposed tractable representations, with some subsequent representations being instances of…

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

$\textit{Normalizer circuits}$ [1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems $\mathcal{H}_{d_1}\otimes ... \otimes \mathcal{H}_{d_n}$ with a standard basis labeled by the elements of a finite…

In this work we exploit Dirac's Constraint Analysis (DCA) in Hamiltonian formalism to study different types of Superconducting Quantum Circuits (SQC) in a {\it{unified}} way. The Lagrangian of a SQC reveals the constraints, that are…

We define new higher-order Alexander modules $\mathcal{A}_n(C)$ and higher-order degrees $\delta_n(C)$ which are invariants of the algebraic planar curve $C$. These come from analyzing the module structure of the homology of certain…

We present a procedure which allows one to integrate explicitly the class of checkerboard IC-nets which has recently been introduced as a generalisation of incircular (IC) nets. The latter class of privileged congruences of lines in the…

Circuit algebras are a symmetric analogue of Jones's planar algebras introduced to study finite-type invariants of virtual knotted objects. Circuit algebra structures appear, in different forms, across mathematics. This paper provides a…

The aim of this paper is to generalize the hyperplane section theorem of Gurjar to arbitrary (local) analytic varieties even if the intersection with of hyperplanes is not necessarily isolated. In case of formal varieties, we generalize the…

This paper provides a description of an algebraic setting for the Lagrangian formalism over graded algebras and is intended as the necessary first step towards the noncommutative C-spectral sequence (variational bicomplex). A noncommutative…

We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

This paper investigates neighborhood and algebraic models for predicate modal logics with $\omega$-rules, including non-normal cases. We establish sufficient conditions under which such logics have neighborhood models with constant domains…

We extend a constrained version of Implicit Regularization (CIR) beyond one loop order for gauge field theories. In this framework, the ultraviolet content of the model is displayed in terms of momentum loop integrals order by order in…