English
Related papers

Related papers: Dichotomy on intervals of strong partial Boolean c…

200 papers

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…

Combinatorics · Mathematics 2016-11-22 István Tomon

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,…

Rings and Algebras · Mathematics 2008-01-17 Michael Pinsker

We prove the strong $C^\infty$ closing property, as formulated by Irie, for a class of Hamiltonian diffeomorphisms which includes all pseudo-rotations of projective spaces as well as all Anosov-Katok pseudo-rotations.

Symplectic Geometry · Mathematics 2023-02-15 Erman Cineli , Sobhan Seyfaddini

We establish a dichotomy on the curvature decay for four dimensional complete noncompact non Ricci flat steady gradient Ricci soliton with linear curvature decay and proper potential function. A similar dichotomy is also shown in higher…

Differential Geometry · Mathematics 2021-08-13 Pak-Yeung Chan , Bo Zhu

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

Logic · Mathematics 2026-04-09 Hrafn Valtýr Oddsson

We give an example of a finitely based locally finite variety which has uncountably many term clones. (Such varieties were known before.)

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern

The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any…

Rings and Algebras · Mathematics 2018-12-27 Radomír Halaš , Jozef Pócs

We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…

Logic · Mathematics 2008-02-03 Saharon Shelah

For every uncountable cardinal mu there is a ccc Boolean algebra whose topological density is mu .

Logic · Mathematics 2008-02-03 Mariusz Rabus , Saharon Shelah

We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $\kappa$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both…

Logic · Mathematics 2010-03-15 Lajos Soukup

Given two finite abstract simplicial complexes A and B, one can define a new simplicial complex on the set of simplicial maps from A to B. After adding two technicalities, we call this complex Homsc(A, B). We prove the following dichotomy:…

General Topology · Mathematics 2024-08-16 Sebastian Meyer

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

Functional Analysis · Mathematics 2019-10-03 Colin C. Graham

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

Optimization and Control · Mathematics 2020-07-09 Feng Guo , Liguo Jiao , Do Sang Kim

In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…

Logic · Mathematics 2024-11-26 Toshimichi Usuba

We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…

Rings and Algebras · Mathematics 2020-01-15 Endre Tóth , Tamás Waldhauser

Whenever all differences between zeros of two holomorphic almost periodic functions in a strip form a discrete set, then both functions are infinite products of periodic functions with commensurable periods. In particular, the result is…

Complex Variables · Mathematics 2015-03-03 Sergii Yu. Favorov

The main problem of clone theory is to describe the clone lattice for a given basic set. For a two-element basic set this was resolved by E.L. Post, but for at least three-element basic set the full structure of the lattice is still…

Rings and Algebras · Mathematics 2024-02-01 Dragan Mašulović , Maja Pech

This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…

Optimization and Control · Mathematics 2014-11-03 Hsien-Chung Wu

No-cloning theorem says that there is no unitary operation that makes perfect clones of non-orthogonal quantum states. The objective of the present paper is to examine whether an imperfect cloning operation exists or not in a C*-algebraic…

Quantum Physics · Physics 2015-06-23 Yuichiro Kitajima

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

Group Theory · Mathematics 2013-01-07 N. Abu-Ghazalh , Nik Ruskuc