Related papers: A Decomposition Theorem for Aronszajn Lines
Motivated by the Bruhat and Cartan decompositions of general linear groups over local fields, double cosets of the group of label preserving automorphisms of a label-regular tree over the fixator of an end of the tree and over maximal…
For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…
We give necessary and sufficient conditions for a linear reflection group in the sense of Vinberg to be Zariski-dense in the ambient projective general linear group. As an application, we show that every irreducible right-angled Coxeter…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…
The graded-fermion algebra and quasi-spin formalism are introduced and applied to obtain the $gl(m|n)\downarrow osp(m|n)$ branching rules for the "two-column" tensor irreducible representations of gl(m|n), for the case $m\leq n (n > 2)$. In…
Let $G$ be an abelian group of order $n$ and let $R$ be a commutative ring which admits a homomorphism ${\Bbb Z}[\zeta_{n}]\ra R$, where $\zeta_{n}$ is a (complex) primitive $n$-th root of unity. Given a finite $R[G\e]$-module $M$, we…
We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).
Vizing's theorem states that any $n$-vertex $m$-edge graph of maximum degree $\Delta$ can be edge colored using at most $\Delta + 1$ different colors. Vizing's original proof is easily translated into a deterministic $O(mn)$ time algorithm.…
Let $X\subset \mathbb{C}^n$ be a smooth irreducible affine variety of dimension $k$ and let $F: X\to \mathbb{C}^m$ be a polynomial mapping. We prove that if $m\ge k$, then there is a Zariski open dense subset $U$ in the space of linear…
Call a colouring of a graph distinguishing if the only automorphism which preserves it is the identity. We investigate the role of the Axiom of Choice in the existence of certain proper or distinguishing colourings in both vertex and edge…
In this paper, we apply Clausen-Scholze's theory of solid modules to the existence of adelic decompositions for schemes of finite type over $\mathbb{Z}$. Specifically, we use the six-functor formalism for solid modules to define the…
Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
We obtain sufficient conditions for the emergence of spanning and almost-spanning bounded-degree {\sl rainbow} trees in various host graphs, having their edges coloured independently and uniformly at random, using a predetermined palette.…
To every Poisson algebraic variety X over an algebraically closed field of characteristic zero, we canonically attach a right D-module M(X) on X. If X is affine, solutions of M(X) in the space of algebraic distributions on X are Poisson…
A decomposition of a simple graph $G$ is a pair $(G,P)$ where $P$ is a set of subgraphs of $G$, which partitions the edges of $G$ in the sense that every edge of $G$ belongs to exactly one subgraph in $P$. If the elements of $P$ are induced…
We use the theory of Kolyvagin systems to prove (most of) a refined class number formula conjectured by Darmon. We show that for every odd prime $p$, each side of Darmon's conjectured formula (indexed by positive integers $n$) is "almost" a…
We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…
The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…