Related papers: Lattices and Parameter Reduction in Division Algeb…

We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…

In this note, we will prove that a finite dimensional Lie algebra $L$ of characteristic zero, admitting an abelian algebra of derivations $D\leq Der(L)$ with the property $$ L^n\subseteq \sum_{d\in D}d(L) $$ for some $n\geq 1$, is…

Let A be a central simple algebra over a field F. Let k_1,\ldots, k_r be cyclic extensions of F such that k_1\otimes_F\cdots \otimes_F k_r is a field. We investigate conditions under which A is a tensor product of symbol algebras where each…

Let $R$ be an integral domain of characteristic zero. We prove that a function $D\colon R\to R$ is a derivation of order $n$ if and only if $D$ belongs to the closure of the set of differential operators of degree $n$ in the product…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the…

Let $K$ be a complete discretely valued field of rank one, with residue field $\Q_p$. It is well known that period equals index in $\Br(K)$. We prove that when $p=2$ there exist noncyclic $K$-division algebras of every $2$-power degree…

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

We study the algebras of modular forms on type IV symmetric domains for simple lattices; that is, lattices for which every Heegner divisor occurs as the divisor of a Borcherds product. For every simple lattice $L$ of signature $(n,2)$ with…

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

According to celebrated Hurwitz theorem, there exists four division algebras consisting of R (real numbers), C (complex numbers), H (quaternions) and O (octonions). Keeping in view the utility of octonion variable we have tried to extend…

In the Dominated Cluster Deletion problem, we are given an undirected graph $G$ and integers $k$ and $d$ and the question is to decide whether there exists a set of at most $k$ vertices whose removal results in a graph in which each…

Over-parametrization is an important technique in training neural networks. In both theory and practice, training a larger network allows the optimization algorithm to avoid bad local optimal solutions. In this paper we study a closely…

Let $Q$ be a subset of a finite distributive lattice $D$. An algebra $A$ represents the inclusion $Q\subseteq D$ by principal congruences if the congruence lattice of $A$ is isomorphic to $D$ and the ordered set of principal congruences of…

The Recognition Theorem for graded Lie algebras is an essential ingredient in the classification of finite-dimensional simple Lie algebras over an algebraically closed field of characteristic p > 3. The main goal of this monograph is to…

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex-deleted subgraphs, known as the deck of G. The Reconstruction Conjecture (RC) posits that every finite simple graph with at least…

We prove that, in any field of characteristic not two and not three except the five-element field, each element decomposes into a product of four factors whose sum vanishes. We also find all $k,n,q$ such that every $n\times n$ matrix over…

We show that the spontaneous breaking of center symmetry can be avoided on a $L^2\times 1^2$ lattice with the appropriate choice of twisted boundary conditions. In order for this to work it is crucial that the twisted boundary conditions…

We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical ${\rm AC}^0$. Among others, we derive such a lower bound for all fpt-approximations of the parameterized clique problem and…

Given a central division algebra $D$ of degree $d$ over a field $F$, we associate to any standard polynomial $\phi(z)=z^n+c_{n-1} z^{n-1}+\dots+c_0$ over $D$ a "companion polynomial" $\Phi(z)$ of degree $n d$ with coefficients in $F$ whose…