Related papers: Eigenvalues and Transduction of Morphic Sequences:…

In deep learning theory, the covariance matrix of the representations serves as a proxy to examine the network's trainability. Motivated by the success of Transformers, we study the covariance matrix of a modified Softmax-based attention…

The transmission eigenvalue problem is a type of non-elliptic and non-selfadjoint spectral problem that arises in the wave scattering theory when invisibility/transparency occurs. The transmission eigenfunctions are the interior resonant…

We demonstrate that commutativity of numerous one-dimensional subalgebras in $W_{1+\infty}$ algebra, i.e. the existence of many non-trivial integrable systems described in recent arXiv:2303.05273 follows from the subset of relations in…

We show that the automorphism group of a linking system associated to a saturated fusion system $\mathcal{F}$ depends only on $\mathcal{F}$ as long as the object set of the linking system is $\mathrm{Aut}(\mathcal{F})$-invariant. This was…

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

Let $(\Omega, \leq)$ be a totally ordered set. We prove that if Aut$(\Omega,\leq)$ is transitive and satisfies the same first-order sentences as the automorphism group of the real line (in the language of groups) then $\Omega$ and and the…

An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where the directive sequence consists of…

Given an abelian category $\mathcal{A}$ with enough injectives we show that a short exact sequence of chain complexes of objects in $\mathcal{A}$ gives rise to a short exact sequence of Cartan-Eilenberg resolutions. Using this we construct…

For a surjective self-morphism on a projective variety defined over a number field, we study the preimages question, which asks if the set of rational points on the iterated preimages of an invariant closed subscheme eventually stabilize.…

We answer the question of Frantzikinakis and Host about the convergence of ergodic $(n^2,n^3)$-averages and consider a more general case. Let sequences ${ p(n)},{ q(n)}$ satisfy the property $ p(n+1)- p(n), \ q(n+1)- q(n)\ \to\ +\infty.$…

Given a smooth closed embedded self-shrinker $S$ with index $I$ in $\mathbb{R}^{n}$, we construct an $I$-dimensional family of complete translators polynomially asymptotic to $S\times\mathbb{R}$ at infinity, which answers a long-standing…

The property of shadowing has been shown to be fundamental in both the theory of symbolic dynamics as well as continuous dynamical systems. A quintessential class of discontinuous dynamical systems are those driven by transitive piecewise…

Let f be a transcendental meromorphic function. Suppose that the finite part of the postsingular set of f is bounded, that f has no recurrent critical points or wandering domains, and that the degree of pre-poles of f is uniformly bounded.…

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

In this paper we show that for every $2\leq n\in \mathbb{N}$, the statement "there is an $n$-entangled set, but there are no $n+1$-entangled sets" is consistent. We also prove some theorems which improve our understanding of entangled sets…

Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic. We prove that a graph class $\mathscr{C}$ can be $\mathsf{FO}$-transduced from a class of bounded-height…

Continuum electrodynamics is an axiomatic formal theory based on the macroscopic Maxwell equations and the constitutive relations. We apply the formal theory to a thermodynamically closed system consisting of an antireflection coated block…

Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…

Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…