Related papers: When isometry and equivalence for skew constacycli…

Einstein-Maxwell theory is not only covariant under diffeomorphisms but also is under $U(1)$ gauge transformations. We introduce a combined transformation constructed out of diffeomorphism and $U(1)$ gauge transformation. We show that…

This work is motivated by the question of whether there are spaces $X$ for which the Farber-Grant symmetric topological complexity $TC^S(X)$ differs from the Basabe-Gonz\'alez-Rudyak-Tamaki symmetric topological complexity $TC^\Sigma(X)$.…

We equip the complex polynomial algebra C[t] with the involution which is the identity on C and sends t to -t. Answering a question raised by V.G. Kac, we show that every hermitian or skew-hermitian matrix over this algebra is congruent to…

A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a graph $G$ is edge covered by connected isometric subgraphs…

For a finite-dimensional simple Lie algebra $\mathfrak{g}$ admitting a non-trivial minuscule representation and a connected marked surface $\Sigma$ with at least two marked points and no punctures, we prove that the cluster algebra…

Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic…

Symmetry is at the heart of coding theory. Codes with symmetry, especially cyclic codes, play an essential role in both theory and practical applications of classical error-correcting codes. Here we examine symmetry properties for codeword…

The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…

In this paper we study the equivalence of quantum stabilizer codes via symplectic isometries of stabilizer codes. We define monomially and symplectically equivalent stabilizer codes and determine how different the two notions can be.…

We prove that if $H$ is a subgroup of index $n$ of any cyclic group $G$, then $G$ can be isometrically embedded in $(H^n, d_{_{Ham}}^n)$, thus generalizing previous results of Carlet (1998) for $G=\mathbb{Z}_{2^k}$ and Yildiz-\"Ozger (2012)…

Let $U$ and $V$ be finite-dimensional vector spaces over an arbitrary field $\mathbb{K}$, and $\mathcal{S}$ be a linear subspace of the space $\mathcal{L}(U,V)$ of all linear maps from $U$ to $V$. A map $F : \mathcal{S} \rightarrow V$ is…

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

In this paper we study Holder continuous linear cocycles over transitive Anosov diffeomorphisms. Under various conditions of relative pinching we establish properties including existence and continuity of measurable invariant sub-bundles…

In the quantization of gauge theories and quantum gravity, it is crucial to treat reference frames such as rods or clocks not as idealized external classical relata, but as internal quantum subsystems. In the Page-Wootters formalism, for…

We show that the symmetry groups of the cut cone Cut(n) and the metric cone Met(n) both consist of the isometries induced by the permutations on {1,...,n}; that is, Is(Cut(n))=Is(Met(n))=Sym(n) for n>4. For n=4 we have…

We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…

Let $S_n$ denote the symmetric group on $n$ elements, and $\Sigma\subseteq S_{n}$ a symmetric subset of permutations. Aldous' spectral gap conjecture, proved by Caputo, Liggett and Richthammer [arXiv:0906.1238], states that if $\Sigma$ is a…

A dessin is a 2-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of orientation- and colour-preserving automorphisms acts regularly on the edges. In this paper we…

The goal of the paper is to introduce a version of Schubert calculus for each dihedral reflection group W. That is, to each "sufficiently rich'' spherical building Y of type W we associate a certain cohomology theory and verify that, first,…