اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSymbolic determinant identity testing and non-commutative ranks of matrix Lie algebras
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
One approach to make progress on the symbolic determinant identity testing (SDIT) problem is to study the structure of singular matrix spaces. After settling the non-commutative rank problem (Garg-Gurvits-Oliveira-Wigderson, Found. Comput. Math. 2020; Ivanyos-Qiao-Subrahmanyam, Comput. Complex. 2018), a natural next step is to understand singular matrix spaces whose non-commutative rank is full. At present, examples of such matrix spaces are mostly sporadic, so it is desirable to discover them in a more systematic way. In this paper, we make a step towards this direction, by studying the family of matrix spaces that are closed under the commutator operation, that is matrix Lie algebras. On the one hand, we demonstrate that matrix Lie algebras over the complex number field give rise to singular matrix spaces with full non-commutative ranks. On the other hand, we show that SDIT of such spaces can be decided in deterministic polynomial time. Moreover, we give a characterization for the matrix Lie algebras to yield a matrix space possessing singularity certificates as studied by Lovasz (B. Braz. Math. Soc., 1989) and Raz and Wigderson (Building Bridges II, 2019).
قيم البحث
اقرأ أيضاً
In this paper, we develop a geometric approach to study derived tame finite dimensional associative algebras, based on the theory of non-commutative nodal curves.
In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring $mathbb{F}{x_1,x_2,ldots,x_n}$. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayof
f [HWY10], and they showed lower bounds and proved completeness results. We consider Polynomial Identity Testing (PIT) and polynomial factorization over $mathbb{F}{x_1,x_2,ldots,x_n}$ and show the following results. (1) Given an arithmetic circuit $C$ of size $s$ computing a polynomial $fin mathbb{F} {x_1,x_2,ldots,x_n}$ of degree $d$, we give a deterministic $poly(n,s,d)$ algorithm to decide if $f$ is identically zero polynomial or not. Our result is obtained by a suitable adaptation of the PIT algorithm of Raz-Shpilka [RS05] for noncommutative ABPs. (2) Given an arithmetic circuit $C$ of size $s$ computing a polynomial $fin mathbb{F} {x_1,x_2,ldots,x_n}$ of degree $d$, we give an efficient deterministic algorithm to compute circuits for the irreducible factors of $f$ in time $poly(n,s,d)$ when $mathbb{F}=mathbb{Q}$. Over finite fields of characteristic $p$, our algorithm runs in time $poly(n,s,d,p)$.
We consider two different constructions of higher brackets. First, based on a Grassmann-odd, nilpotent Delta operator, we define a non-commutative generalization of the higher Koszul brackets, which are used in a generalized Batalin-Vilkovisky algebr
a, and we show that they form a homotopy Lie algebra. Secondly, we investigate higher, so-called derived brackets built from symmetrized, nested Lie brackets with a fixed nilpotent Lie algebra element Q. We find the most general Jacobi-like identity that such a hierarchy satisfies. The numerical coefficients in front of each term in these generalized Jacobi identities are related to the Bernoulli numbers. We suggest that the definition of a homotopy Lie algebra should be enlarged to accommodate this important case. Finally, we consider the Courant bracket as an example of a derived bracket. We extend it to the big bracket of exterior forms and multi-vectors, and give closed formulas for the higher Courant brackets.
A compound determinant identity for minors of rectangular matrices is established. As an application, we derive Vandermonde type determinant formulae for classical group characters.
We discuss a version of the Chevalley--Eilenberg cohomology in characteristic $2$, where the alternating cochains are replaced by symmetric ones.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
