English
Related papers

Related papers: Arithmetical Congruence Preservation: from Finite …

200 papers

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

In this paper, as an analogue of the integer case, we define congruence preserving functions over the residue class rings of polynomials over finite fields. We establish a counting formula for such congruence preserving functions, determine…

Number Theory · Mathematics 2019-10-22 Xiumei Li , Min Sha

We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…

Logic · Mathematics 2024-10-08 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We investigate when the clone of congruence preserving functions is finitely generated. We obtain a full description for all finite $p$-groups, and for all finite algebras with Mal'cev term and simple congruence lattice. The…

Rings and Algebras · Mathematics 2019-09-04 Erhard Aichinger , Marijana Lazić , Nebojša Mudrinski

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

Computational Complexity · Computer Science 2024-04-12 Yahel Manor , Or Meir

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

In this paper, we extend properties Going Up and Lying Over from ring theory to the general setting of congruence--modular equational classes, using the notion of prime congruence defined through the commutator. We show how these two…

Rings and Algebras · Mathematics 2016-08-18 George Georgescu , Claudia Mureşan

We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…

Number Theory · Mathematics 2015-06-02 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

Polynomial completeness results aim at characterizing those functions that are induced by polynomials. Each polynomial function is congruence preserving, but the opposite need not be true. A finite algebraic structure $\mathbf{A}$ is called…

Rings and Algebras · Mathematics 2024-04-23 Bernardo Rossi

In calculus, an indefinite integral of a function $f$ is a differentiable function $F$ whose derivative is equal to $f$. In present paper, we generalize this notion of the indefinite integral from the ring of real functions to any ring. The…

Rings and Algebras · Mathematics 2014-06-13 Iztok Banic

We introduce $p$-adic Kummer spaces of continuous functions on $\mathbb{Z}_p$ that satisfy certain Kummer type congruences. We will classify these spaces and show their properties, for instance, ring properties and certain decompositions.…

Number Theory · Mathematics 2009-10-07 Bernd C. Kellner

A function $f:X\to Y$ between topological spaces is called {\em compact-preserving} if the image $f(K)$ of each compact subset $K\subset X$ is compact. We prove that a function $f:X\to Y$ defined on a strong Frechet space $X$ is…

General Topology · Mathematics 2013-05-28 Taras Banakh , Artur Bartoszewicz , Marek Bienias , Szymon Glab

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

Group Theory · Mathematics 2007-05-23 Kai-Uwe Bux , Kevin Wortman

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…

Formal Languages and Automata Theory · Computer Science 2023-04-19 Thomas Colcombet , Gaëtan Douéneau-Tabot , Aliaume Lopez

We introduce a notion of positive definiteness for functions $f\!:P\to\mathbb{R}$ defined on meet semilattices $(P,\preceq,\wedge)$ and prove several properties for these functions. In addition, we utilize the $LDL^{\rm T}$ decomposition of…

Number Theory · Mathematics 2020-04-29 Vesa Kaarnioja , Pentti Haukkanen , Pauliina Ilmonen , Mika Mattila

We know that for a finite field $F$, every function on $F$ can be given by a polynomial with coefficients in $F$. What about the converse? i.e. if $R$ is a ring (not necessarily commutative or with unity) such that every function on $R$ can…

Commutative Algebra · Mathematics 2017-12-13 Souvik Dey

In this paper we formulate order preserving quotient lifting property and the compact lifting property. In the case of affine continuous functions on a Choquet simplex, we show the compact quotient lifting property for the space of affine…

Functional Analysis · Mathematics 2022-12-13 Taduri Srinivasa Siva Rama Krishna Rao

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…

Computational Complexity · Computer Science 2012-03-01 Stephen A. Fenner

In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…

Number Theory · Mathematics 2021-11-02 Daniël M. H. van Gent
‹ Prev 1 2 3 10 Next ›