English
Related papers

Related papers: Logical Characterization of Algebraic Circuit Clas…

200 papers

We have recently presented a general method of proving the fundamental logical properties of Craig and Lyndon Interpolation (IPs) by induction on derivations in a wide class of internal sequent calculi, including sequents, hypersequents,…

Logic in Computer Science · Computer Science 2023-08-01 Roman Kuznets

We present a self-contained analysis of infinity from two mathematical perspectives: set theory and algebra. We begin with cardinal and ordinal numbers, examining deep questions such as the continuum hypothesis, along with foundational…

History and Overview · Mathematics 2025-05-16 Noah Betz

We introduce a new categorical and constructive foundation for analytic approximation based on a Contextual Choice Principle (CCP), which enforces locality and compatibility in the construction of mathematical objects. Central to our…

Functional Analysis · Mathematics 2025-07-22 Andreu Ballus Santacana

Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…

Quantum Physics · Physics 2025-10-23 Chaitanya Karamchedu , Matthew Fox , Daniel Gottesman

A previously established correspondence between definite-parity real functions and inner analytic functions is generalized to real functions without definite parity properties. The set of inner analytic functions that corresponds to the set…

Complex Variables · Mathematics 2015-05-12 Jorge L. deLyra

The \begin{it} Invariance Theorem \end{it} of M. Gerstenhaber and S. D. Schack states that if $\mathbb{A}$ is a diagram of algebras then the subdivision functor induces a natural isomorphism between the Yoneda cohomologies of the category…

Category Theory · Mathematics 2010-08-12 Alin Stancu

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

We present a graded-geometric approach to modular classes of Lie algebroids and their generalizations, introducing in this setting an idea of relative modular class of a Dirac structure for a certain type of Courant algebroids, called…

Differential Geometry · Mathematics 2017-01-17 Janusz Grabowski

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…

Category Theory · Mathematics 2020-07-01 Saugata Basu , M. Umut Isik

An extension of the Dirac procedure for the quantization of constrained systems is necessary to address certain issues that are left open in Dirac's original proposal. These issues play an important role especially in the context of…

General Relativity and Quantum Cosmology · Physics 2009-10-22 A. Ashtekar , Ranjeet S. Tate

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

Commutative Algebra · Mathematics 2014-04-01 Gregor Kemper

We study a class of newly-introduced CFTs associated with even quadratic forms of general signature, which we call generalized Narain theories. We first summarize the properties of these theories. We then consider orbifolds of these…

High Energy Physics - Theory · Physics 2025-07-02 Meer Ashwinkumar , Abhiram Kidambi , Jacob M. Leedom , Masahito Yamazaki

Several devices exhibiting memory effects have shown up in nonlinear circuit theory in recent years. Among others, these circuit elements include Chua's memristors, as well as memcapacitors and meminductors. These and other related devices…

Dynamical Systems · Mathematics 2013-07-09 Ricardo Riaza

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

Logic in Computer Science · Computer Science 2022-04-25 Takeshi Tsukada , Kazuyuki Asada

Given a fine abelian group grading on a finite dimensional simple Lie algebra over an algebraically closed field of characteristic zero, with universal grading group $G$, it is shown that the induced grading by the free group $G/\tor(G)$ is…

Rings and Algebras · Mathematics 2013-03-05 Alberto Elduque

We suggest the necessary/sufficient criteria for the existence of a (order-by-order) solution y(x) of a functional equation F(x,y)=0 over a ring. In full generality, the criteria hold in the category of filtered groups, this includes the…

Commutative Algebra · Mathematics 2016-04-05 Genrich Belitskii , Dmitry Kerner

In this paper, we introduce a general family of sequent-style calculi over the modal language and its fragments to capture the essence of all constructively acceptable systems. Calling these calculi \emph{constructive}, we show that any…

Logic · Mathematics 2022-10-18 Amirhossein Akbar Tabatabai , Raheleh Jalali

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Number Theory · Mathematics 2018-07-09 Fusun Akman

Given a completely positive map, we introduce a set of algebras that we refer to as its generalized multiplicative domains. These algebras are generalizations of the traditional multiplicative domain of a completely positive map and we…

Quantum Physics · Physics 2015-03-17 Nathaniel Johnston , David W. Kribs

We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…

Logic · Mathematics 2024-08-02 Sylvy Anscombe , Dugald Macpherson , Charles Steinhorn , Daniel Wolf
‹ Prev 1 8 9 10 Next ›