English
Related papers

Related papers: The Algebra of Iterative Constructions

200 papers

Independent component analysis (ICA) is a statistical method for transforming an observable multidimensional random vector into components that are as statistically independent as possible from each other.Usually the ICA framework assumes a…

Information Theory · Computer Science 2015-08-21 Amichai Painsky , Saharon Rosset , Meir Feder

We introduce the notion of an ACP process algebra and the notion of a meadow enriched ACP process algebra. The former notion originates from the models of the axiom system ACP. The latter notion is a simple generalization of the former…

Logic in Computer Science · Computer Science 2013-08-07 J. A. Bergstra , C. A. Middelburg

Consider a proper cocompact CAT(0) space X. We give a complete algebraic characterisation of amenable groups of isometries of X. For amenable discrete subgroups, an even narrower description is derived, implying Q-linearity in the…

Group Theory · Mathematics 2014-05-15 Pierre-Emmanuel Caprace , Nicolas Monod

The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…

General Mathematics · Mathematics 2017-01-13 Md Ahmadullah , Mohammad Imdad , Mohammad Arif

We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…

Logic · Mathematics 2014-08-21 Marcel Jackson , Tim Stokes

We construct the Feigin-Stoyanovsky (combinatorial) basis in case of one-dimensional lattice vertex superalgebras $V_{\sqrt{N}\,\mathbb{Z}}$. Our proof is based on invariance of semi-infinite monomials linear span under action of…

Mathematical Physics · Physics 2024-02-01 Timur Kenzhaev

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

Logic in Computer Science · Computer Science 2025-09-03 Go Hashimoto , Daniel Găină

In this paper after proving (in Section 2) the Berkovich analytic space analog of the familiar fact that there exist many non-isomorphic Riemann surfaces of the fixed topological type, I introduce the precise notion of Arithmetic…

Algebraic Geometry · Mathematics 2025-02-25 Kirti Joshi

We consider when the symmetric algebra of an infinite-dimensional Lie algebra, equipped with the natural Poisson bracket, satisfies the ascending chain condition (ACC) on Poisson ideals. We define a combinatorial condition on a graded Lie…

Rings and Algebras · Mathematics 2023-02-07 Omar Leon Sanchez , Susan J. Sierra

We study the problem of solving fixed-point equations for seminorm-contractive operators and establish foundational results on the non-asymptotic behavior of iterative algorithms in both deterministic and stochastic settings. Specifically,…

Machine Learning · Computer Science 2025-02-21 Zaiwei Chen , Sheng Zhang , Zhe Zhang , Shaan Ul Haque , Siva Theja Maguluri

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…

Logic in Computer Science · Computer Science 2011-06-28 J. A. Bergstra , A. Ponse

We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…

Machine Learning · Computer Science 2023-11-06 Zachary Chase , Bogdan Chornomaz , Shay Moran , Amir Yehudayoff

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

Ellipses are a meta-linguistic notation for denoting terms the size of which are specified by a meta-variable that ranges over the natural numbers. In this work, we present a systematic approach for encoding such meta-expressions in the…

Logic in Computer Science · Computer Science 2017-01-11 Mayer Goldberg

In this paper we show that an intuitionistic theory for fixed points is conservative over the Heyting arithmetic with respect to a certain class of formulas. This extends partly the result of mine. The proof is inspired by the quick…

Logic · Mathematics 2013-04-11 Toshiyasu Arai

For an action of a finite group on a C*-algebra, we present some conditions under which properties of the C*-algebra pass to the crossed product or the fixed point algebra. We mostly consider the ideal property, the projection property,…

Operator Algebras · Mathematics 2012-08-21 Cornel Pasnicu , N. Christopher Phillips

We apply to the semantics of Arithmetic the idea of ``finite approximation'' used to provide computational interpretations of Herbrand's Theorem, and we interpret classical proofs as constructive proofs (with constructive rules for $\vee,…

Logic in Computer Science · Computer Science 2015-07-01 Federico Aschieri , Stefano Berardi

It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…

Representation Theory · Mathematics 2014-07-10 Birge Huisgen-Zimmermann

M. Field [5] refers to an unpublished work by J. Ize for a result that loss of stability through an absolutely irreducible representation of a compact Lie group leads to bifurcation of steady states. The main ingredient of the proof is the…

Dynamical Systems · Mathematics 2021-01-27 Reiner Lauterbach

Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to study global decision problems for finitely generated…

Group Theory · Mathematics 2025-10-16 Emmanuel Rauzy