中文
相关论文

相关论文: Expansions of abelian squarefree groups

200 篇论文

Given a_1,a_2,...,a_n in Z^d, we examine the set, G, of all non-negative integer combinations of these a_i. In particular, we examine the generating function f(z)=\sum_{b\in G} z^b. We prove that one can write this generating function as a…

组合数学 · 数学 2015-05-08 Herbert E. Scarf , Kevin M. Woods

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

环与代数 · 数学 2011-02-23 Tamás Waldhauser

We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving…

组合数学 · 数学 2023-09-15 Dinh Van Le , Tim Römer

We study acts and modules of maximal growth over finitely generated free monoids and free associative algebras as well as free groups and free group algebras. The maximality of the growth implies some other specific properties of these acts…

群论 · 数学 2014-02-26 Yuri Bahturin , Alexander Olshanskii

We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le \omega$, which are closed under composition and include all projections. This is a natural extension to countable arities of…

逻辑 · 数学 2024-07-10 Ruiyuan Chen , Ilir Ziba

We first determine the maximal clones on a set X of infinite regular cardinality which contain all permutations but not all unary functions, extending a result of Heindorf's for countably infinite X. If |X| is countably infinite or weakly…

环与代数 · 数学 2007-05-23 Michael Pinsker

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

逻辑 · 数学 2025-11-18 J. B. Nation , Gianluca Paolini

For $d \geq 4$ and $p$ a sufficiently large prime, we construct a lattice $\Gamma \leq {\rm PSp}_{2d}(\mathbb Q_p),$ such that its universal central extension cannot be sofic if $\Gamma$ satisfies some weak form of stability in…

群论 · 数学 2024-03-19 Lukas Gohla , Andreas Thom

We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…

环与代数 · 数学 2010-09-07 Michael Pinsker

We consider algebras with one binary operation $\cdot$ and one generator ({\it monogenic}) and satisfying the left distributive law $a\cdot (b\cdot c)=(a\cdot b)\cdot (a\cdot c)$. One can define a sequence of finite left-distributive…

逻辑 · 数学 2021-02-09 Randall Dougherty , Thomas Jech

We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…

离散数学 · 计算机科学 2018-04-13 Andrei Bulatov , Leslie Ann Goldberg , Mark Jerrum , David Richerby , Stanislav Živný

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

组合数学 · 数学 2026-01-05 Robert Coulter , Steven Senger

We investigate the finitary functions from a finite field $\mathbb{F}_q$ to the finite field $\mathbb{F}_p$, where $p$ and $q$ are powers of different primes. An $(\mathbb{F}_p,\mathbb{F}_q)$-linearly closed clonoid is a subset of these…

环与代数 · 数学 2020-06-02 Stefano Fioravanti

Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…

环与代数 · 数学 2026-02-05 Stefano Fioravanti , Michael Kompatscher , Bernardo Rossi

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated $3$-step solvable group has finite palindromic width. More generally, we show the finiteness of palindromic width for…

群论 · 数学 2015-10-29 Valeriy G. Bardakov , Krishnendu Gongopadhyay

We prove that the dual fine Selmer group of an abelian variety over the unramified $\mathbb{Z}_{p}$-extension of a function field is finitely generated over $\mathbb{Z}_{p}$. This is a function field version of a conjecture of…

数论 · 数学 2025-08-19 Sohan Ghosh , Jishnu Ray , Takashi Suzuki

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

环与代数 · 数学 2017-02-16 James Emil Avery , Jean-Yves Moyen , Pavel Ruzicka , Jakob Grue Simonsen

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…

环与代数 · 数学 2016-09-07 Michael Pinsker

We show that the class of all aggregation functions on $[0,1]$ can be generated as a composition of infinitary sup-operation $\bigvee$ acting on sets with cardinality not exceeding $\mathfrak{c}$, $b$-medians $\mathsf{Med}_b$, $b\in[0,1[$,…

逻辑 · 数学 2018-10-16 Radomír Halaš , Radko Mesiar , Jozef Pócs

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

数论 · 数学 2016-06-03 R. Balasubramanian , Gyan Prakash , D. S. Ramana