arXiv subjects
Publications and source records attributed to Sabrina Alexandra Gaube.
We discuss how to resolve generic skew-symmetric and generic symmetric determinantal singularities. The key ingredients are (skew-) symmetry preserving matrix operations in order to deduce an inductive argument.
We present an adapted construction of algebraic circuits over the reals introduced by Cucker and Meer to arbitrary infinite integral domains and generalize the $\mathrm{AC}_{\mathbb{R}}$ and $\mathrm{NC}_{\mathbb{R}}$-classes for this setting. We give a theorem in the style of Immerman's theorem which shows that for these adapted formalisms, sets decided by circuits of constant depth and polynomial size are the same as sets definable by a suitable adaptation of first-order logic. Additionally, we discuss a generalization of the guarded predicative logic by Durand, Haak and Vollmer and we show characterizations for the $\mathrm{AC}_{R}$ and $\mathrm{NC}_{R}$ hierarchy. Those generalizations apply to the Boolean $\mathrm{AC}$ and $\mathrm{NC}$ hierarchies as well. Furthermore, we introduce a formalism to be able to compare some of the aforementioned complexity classes with different underlying integral domains.
We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of numerous examples. We focus on a local variant, where centers are not required to be chosen globally. Moreover, we do not necessarily demand that centers are contained in the singular locus. Despite these restrictions, the techniques are connected to the computation of $ p $-adic integral whose data is given by finitely many binomials.