Related papers: Cohesive Powers of Linear Orders

Let $R$ be a commutative ring $R$ with $1_R$ and with group of units $R^{\times}$. Let $\Phi = \Phi(t_1,\ldots, t_h) = \sum_{i=1}^h \varphi_it_i$ be an $h$-ary linear form with nonzero coefficients $\varphi_1,\ldots, \varphi_h \in R$. Let…

The standard view is that PDEs are much more complex than ODEs, but, as will be shown below, for finite derivatives this is not true. We consider the $C^*$-algebras ${\mathscr H}_{N,M}$ consisting of $N$-dimensional finite differential…

We give an overview of the F-product construction and the corresponding nonstandard constructions for strongly continuous one-parameter semigroups of linear operators, and show that (in the case of bounded ultrapowers) both constructs are…

In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…

There have been many parallel streams of research studying order isomorphisms of some specific sets $G$ of functions from a set $X$ to $\mathbb{R}\cup\{\pm\infty\}$, such as the sets of convex or Lipschitz functions. We develop in this…

We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…

We show that every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has linear growth. This implies that the the corresponding semigroup algebra is a PI algebra.

Quantum LDPC codes have attracted intense interest due to their advantageous properties for realizing efficient fault-tolerant quantum computing. In particular, sheaf codes represent a novel framework that encompasses all well-known good…

We prove that, consistently with ZFC, no ultraproduct of countably infinite (or separable metric, non-compact) structures is isomorphic to a reduced product of countable (or separable metric) structures associated to the Fr\'echet filter.…

This paper is devoted to heuristic aspects of the so-called idempotent calculus. There is a correspondence between important, useful and interesting constructions and results over the field of real (or complex) numbers and similar…

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Let $U$ be a unipotent group which is graded in the sense that it has an extension $H$ by the multiplicative group of the complex numbers such that all the weights of the adjoint action on the Lie algebra of $U$ are strictly positive. We…

The article studies power complexes and generalized power complexes, and investigates the algebraic structure of their automorphism groups. The combinatorial incidence structures involved are cube-like, in the sense that they have many…

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

We introduce $\mathcal{V}$-polyhedral disjunctive cuts (VPCs) for generating valid inequalities from general disjunctions. Cuts are critical to integer programming solvers, but the benefit from many families is only realized when the cuts…

Following our previous work, we suggest here a large class of algebras of scalars in which simultaneous and correlated computations can be performed owing to the existence of surjective algebra homomorphisms. This may replace the currently…

An \emph{automorphic loop} (or \emph{A-loop}) is a loop whose inner mappings are automorphisms. Every element of a commutative A-loop generates a group, and $(xy)^{-1} = x^{-1}y^{-1}$ holds. Let $Q$ be a finite commutative A-loop and $p$ a…

Computational paths treat propositional equality as explicit paths built from labelled deduction steps and rewrite rules. This view originates in work by de Queiroz and collaborators [1] and yields a weak groupoid structure for equality,…

We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…