
definability of linear equation systems over
... adding operators for expressing the rank of definable matrices over finite fields to first-order logic and fixed-point logic. They showed that fixed-point logic with rank operators (FPR) can define not only the solvability of linear equation systems over finite fields, but also the CFI query and ess ...
... adding operators for expressing the rank of definable matrices over finite fields to first-order logic and fixed-point logic. They showed that fixed-point logic with rank operators (FPR) can define not only the solvability of linear equation systems over finite fields, but also the CFI query and ess ...
Joint Reductions, Tight Closure, and the Briancon
... there is a nice “linear” relation between tight closures and integral closures of powers of an ideal: for every ideal I of positive height, there exists an integer I such that for all positive integers k, Ill E (I ’ + ’ )*. Restriction to regular rings gives such a “linear” relation between powers o ...
... there is a nice “linear” relation between tight closures and integral closures of powers of an ideal: for every ideal I of positive height, there exists an integer I such that for all positive integers k, Ill E (I ’ + ’ )*. Restriction to regular rings gives such a “linear” relation between powers o ...
Partition functions
... • Give a clear definition product product and verify that all axioms defining a weak Hopf algebra are satisfied. • Obtain explicitly the Ocneanu graphs from the algebraic structures of B. • Study of the others su(3) cases + su(4) cases. • Conformal systems defined on higher genus surfaces. ...
... • Give a clear definition product product and verify that all axioms defining a weak Hopf algebra are satisfied. • Obtain explicitly the Ocneanu graphs from the algebraic structures of B. • Study of the others su(3) cases + su(4) cases. • Conformal systems defined on higher genus surfaces. ...