相关论文: Lattices and Parameter Reduction in Division Algeb…
In this paper, a new invariant was built towards the classification of separable C*-algebras of real rank zero, which we call latticed total K-theory. A classification theorem is given in terms of such an invariant for a large class of…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
In this paper, we show that every highly edge-connected graph $G$, under a necessary and sufficient degree condition, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$ with $1\le i\le k$,…
This paper concerns the problem of classifying finite-dimensional real solvable Lie algebras whose derived algebras are of codimension 1 or 2. On the one hand, we present an effective method to classify all $(n+1)$-dimensional real solvable…
Let $K$ be the fraction field of a 2-dimensional, henselian, excellent local domain with finite residue field $k$. When the characteristic of $k$ is not 2, we prove that every quadratic form of rank $\ge 9$ is isotropic over $K$ using…
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and…
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The…
We review remarkable results in several mathematical scenarios, including graph theory, division algebras, cross product formalism and matroid theory. Specifically, we mention the following subjects: (1) the Euler relation in graph theory,…
We study the parameterized complexity of separating a small set of vertices from a graph by a small vertex-separator. That is, given a graph $G$ and integers $k$, $t$, the task is to find a vertex set $X$ with $|X| \le k$ and $|N(X)| \le…
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…
Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…
We characterize those finite groups for which the bounded derived category of finite dimensional representations over an algebraically closed field of characteristic $p$ has distributive lattice of thick subcategories: they are precisely…
A non-self-adjoint operator algebra is said to be residually finite dimensional (RFD) if it embeds into a product of matrix algebras. We characterize RFD operator algebras in terms of their matrix state space, and moreover show that an…
In this article, we will show the existence of lattice packings in a sparse family of dimensions. This construction will be a generalisation of Venkatesh's lattice packing result. In our construction, we replace the appearance of the…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
Several general properties, concerning reduction algebras - rings of definition and algorithmic efficiency of the set of ordering relations - are discussed. For the reduction algebras, related to the diagonal embedding of the Lie algebra…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
In this work $n$-dimensional filiform Leibniz algebras admitting a gradation of length $(n-1)$ are classified. Derivations of such algebras are also described.
We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are…