English
Related papers

Related papers: Arithmetical Congruence Preservation: from Finite …

200 papers

Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists…

Number Theory · Mathematics 2021-07-27 Stelios Sachpazis

In ring theory, the lifting idempotent property (LIP) is related to some important classes of rings: clean rings, exchange rings, local and semilocal rings, Gelfand rings,maximal rings, etc. Inspired by LIP, there were defined lifting…

Logic in Computer Science · Computer Science 2019-01-21 Daniela Cheptea , George Georgescu

We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and S{\l}omczy{\'n}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is…

Rings and Algebras · Mathematics 2026-04-01 Erhard Aichinger , Mario Kapl , Bernardo Rossi

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

Rings and Algebras · Mathematics 2008-01-09 Martin Goldstern

We present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $(B_0, \dots)$, let $B_1, B_2, \dots, B_K$ be sets that either intersect $B_0$ or…

Rings and Algebras · Mathematics 2013-10-10 William DeMeo

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…

Logic in Computer Science · Computer Science 2022-07-11 Luca Ciccone , Luca Padovani

The characteristic function of row contractions and liftings of row contractions are complete invariants up to unitary equivalence for row contractions and liftings of row contractions, respectively. We provide alternate proofs for these…

Functional Analysis · Mathematics 2023-02-01 Neeru Bala , Santanu Dey , Reshmi M. N

We build on the recent characterisation of congruences on the infinite twisted partition monoids $\mathcal{P}_{n}^\Phi$ and their finite $d$-twisted homomorphic images $\mathcal{P}_{n,d}^\Phi$, and investigate their algebraic and…

Rings and Algebras · Mathematics 2021-11-09 James East , Nik Ruskuc

In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…

Rings and Algebras · Mathematics 2016-07-26 Claudia Mureşan

Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…

Classical Analysis and ODEs · Mathematics 2007-05-23 Margherita Barile , Fiorella Barone , Wlodzimierz M. Tulczyjew

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

Number Theory · Mathematics 2022-08-17 Nicholas Dent , Caleb M. Shor

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Dynamical Systems · Mathematics 2025-11-05 Ben Krause

We consider the problem of characterizing entrywise functions that preserve the cone of positive definite matrices when applied to every off-diagonal element. Our results extend theorems of Schoenberg [Duke Math. J. 9], Rudin [Duke Math. J.…

Classical Analysis and ODEs · Mathematics 2013-05-17 Dominique Guillot , Bala Rajaratnam

D-finite functions and P-recursive sequences are defined in terms of linear differential and recurrence equations with polynomial coefficients. In this paper, we introduce a class of numbers closely related to D-finite functions and…

Number Theory · Mathematics 2018-05-29 Hui Huang , Manuel Kauers

We introduce characteristic functions for certain contractive liftings of row contractions. These are multi-analytic operators which classify the liftings up to unitary equivalence and provide a kind of functional model. The most important…

Operator Algebras · Mathematics 2007-07-11 Santanu Dey , Rolf Gohm

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

General Mathematics · Mathematics 2026-03-13 Marcoen J. T. F. Cabbolet , Adrian R. D. Mathias

Let $P$ be an arbitrary partially ordered set, $R$ a commutative ring with identity and $FI(P,R)$ the finitary incidence algebra of $P$ over $R$. Under some natural assumption on $R$, we prove that each Lie-type derivation of $FI(P,R)$ is…

Rings and Algebras · Mathematics 2019-02-13 Mykola Khrypchenko , Feng Wei

Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable…

Artificial Intelligence · Computer Science 2009-05-25 Sabrina Baselice , Piero A. Bonatti , Giovanni Criscuolo