English
Related papers

Related papers: Injective types in univalent mathematics

200 papers

We determine a necessary and sufficient condition for a polynomial over an algebraically closed field $k$ to induce a surjective map on matrix algebras $M_n(k)$ for $n \ge 2$. The criterion is given in terms of critical points and uses…

Rings and Algebras · Mathematics 2016-12-05 Shubhodip Mondal

The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…

Logic · Mathematics 2023-08-23 Ivan Chajda , Helmut Länger

In this paper, we introduce the notion of relative ultragraph algebras and extend classical injectivity criteria for representations, particularly those arising from branching systems,to this relative setting. This new concept is closely…

Operator Algebras · Mathematics 2025-08-28 Ben-Hur Eidt , Daniel Gonçalves , Danilo Royer

We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant…

Machine Learning · Computer Science 2026-05-26 Nadav Dym , Matthias Wellershoff , Efstratios Tsoukanis , Daniel Levy , Radu Balan

In this paper we present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any cases. This approach allows to give a notion of divisibility…

Numerical Analysis · Computer Science 2009-10-22 Nicolas Goze , Elisabeth Remm

We investigate the extent to which the weak equivalences in a model category can be equipped with algebraic structure. We prove, for instance, that there exists a monad T such that a morphism of topological spaces admits T-algebra structure…

Category Theory · Mathematics 2022-01-31 John Bourke

Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…

Logic in Computer Science · Computer Science 2026-02-16 Hugo Herbelin , Ramkumar Ramachandra

For an endomorphism s of R with s^{t}=1 we prove that the truncated polynomial ring (algebra) R[w,s]/(w^{t}) embeds into M_{t}(R[z]/(z^{t})). For an involution we exhibit an embedding of R into M_{2,1}^{s}(R), where M_{2,1}^{s}(R) is the…

Rings and Algebras · Mathematics 2013-07-09 Jeno Szigeti

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2015-10-02 Jarkko Kari , Michal Szabados

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Logic · Mathematics 2013-08-29 Tarek Sayed Ahmed

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

Combinatorics · Mathematics 2007-05-23 Frederic Patras , Manfred Schocker

In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…

Numerical Analysis · Mathematics 2010-06-29 Nicolas Goze

A noncommutative projective variety is defined, after Artin and Zhang, by a graded coherent algebra A, where the category of coherent sheaves is the quotient qgr(A) of the category of finitely presented graded modules by the subcategory of…

Rings and Algebras · Mathematics 2026-04-16 Dmitri Piontkovski

We formulate a framework for describing behaviour of effectful higher-order recursive programs. Examples of effects are implemented using effect operations, and include: execution cost, nondeterminism, global store and interaction with a…

Logic in Computer Science · Computer Science 2021-12-30 Niccolò Veltri , Niels F. W. Voorneveld

We investigate predicative aspects of order theory in constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work…

Logic · Mathematics 2021-04-22 Tom de Jong , Martín Hötzel Escardó

The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…

Logic in Computer Science · Computer Science 2011-02-08 Bas Spitters , Eelis van der Weegen

We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…

Logic · Mathematics 2013-06-07 Tarek Sayed Ahmed

We present a complex frame of eleven vectors in 4-space and prove that it defines injective measurements. That is, any rank-one $4\times 4$ Hermitian matrix is uniquely determined by its values as a Hermitian form on this collection of…

Functional Analysis · Mathematics 2015-02-17 Cynthia Vinzant

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2016-05-20 Jarkko Kari , Michal Szabados

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym