Related papers: On Derivatives and Subpattern Orders of Countable …
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
We provide a family of group measure space II_1 factors for which all finite index subfactors can be explicitly listed. In particular, the set of all indices of irreducible subfactors can be computed. Concrete examples show that this index…
Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
We introduce derivation depth-a computable metric of the reasoning effort needed to answer a query based on a given set of premises. We model information as a two-layered structure linking abstract knowledge with physical carriers, and…
At the two-derivative order, the group manifold reduction of heterotic supergravity on $S^3$ results in a half-maximal 7D gauged supergravity coupled to three vector multiplets, and a further truncation can be taken to remove the vector…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
Parity is ubiquitous, but not always identified as a simplifying tool for computations. Using parity, having in mind the example of the bosonic/fermionic Fock space, and the framework of Z_2-graded (super) algebra, we clarify relationships…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
In this paper, the Beatty multiple shift is introduced, which is a generalization of the multiplicative shift of finite type (multiple SFT) [Kenyon, Peres and Solomyak, Ergodic Theory and Dynamical Systems, 2012] and the affine multiple…
Given a continuous dynamical system $f:X\to X$ on a compact metric space $X$ and an $m$-dimensional continuous potential $\Phi:X\to \mathbb R^m$, the (generalized) rotation set ${\rm Rot}(\Phi)$ is defined as the set of all $\mu$-integrals…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
In this paper we introduce two new methods for constructing injective resolutions of sheaves of finite-dimensional vector spaces on finite posets. Our main result is the existence and uniqueness of a minimal injective resolution of a given…
In this paper we produce further specification of the geometric and algebraic properties of the earlier introduced superdimensional dual-covariant field theory (SFT) in a N-dimensional manifold [1] as an approach to a unified field theory…
We construct infinite rank summands isomorphic to $\mathbb{Z}^\infty$ in the higher homotopy and homology groups of the diffeomorphism groups of certain $4$-manifolds. These spherical families become trivial in the homotopy and homology…
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic…
For each $\Pi^0_1$ $S\subseteq \mathbb{N}$, let the $S$-square shift be the two-dimensional subshift on the alphabet $\{0,1\}$ whose elements consist of squares of 1s of various sizes on a background of 0s, where the side length of each…
We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance generalize naturally to this setting, and we focus on…
Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong homology. These implications are thematically diverse,…
We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. The construction involves an iteration procedure on an infinite-dimensional…