Skip to main content

FiniteQuadraticModule

Struct FiniteQuadraticModule 

Source
pub struct FiniteQuadraticModule { /* private fields */ }
Expand description

A native finite quadratic module in a cyclic product presentation.

The q_values_mod2 slice is ordered lexicographically over the cyclic factors: for factors [d0, d1, ...], index ((x0*d1 + x1)*d2 + ...) stores q(x0, x1, ...) as a rational in Q/2Z. The constructor validates nonsingularity and the quadratic law up to FQM_WITT_GROUP_CAP.

Implementations§

Source§

impl FiniteQuadraticModule

Source

pub fn new( cyclic_factors: Vec<u128>, q_values_mod2: Vec<Rational>, ) -> Option<Self>

Build a nonsingular finite quadratic module from a cyclic presentation and all of its quadratic values in lexicographic coordinate order.

Source

pub fn cyclic(order: u128, generator_q: Rational) -> Option<Self>

The cyclic module generated by g with q(g) = generator_q.

Source

pub fn direct_sum(&self, other: &Self) -> Option<Self>

Orthogonal direct sum.

Source

pub fn order(&self) -> u128

Order of the finite module.

Source

pub fn cyclic_factors(&self) -> &[u128]

Cyclic factors of this presentation.

Source

pub fn q_values_mod2(&self) -> &[Rational]

Quadratic values in lexicographic coordinate order.

Source

pub fn witt_class(&self) -> Option<FqmWittClass>

The Wall/Nikulin Witt normal form.

Source

pub fn nikulin_existence_report( &self, signature: (usize, usize), ) -> Option<NikulinExistenceInvariants>

Nikulin’s even-lattice existence criterion for this finite quadratic module and the requested signature (t_+, t_-).

This implements Nikulin, Integral symmetric bilinear forms and some of their applications, Math. USSR Izv. 14 (1980), Theorem 1.10.1, in the bounded finite-table model used by witt_class. None means the table/determinant computation exceeded that bounded exact surface, not that the theorem failed.

Source

pub fn nikulin_even_lattice_exists( &self, signature: (usize, usize), ) -> Option<bool>

Boolean convenience wrapper around nikulin_existence_report.

Trait Implementations§

Source§

impl Clone for FiniteQuadraticModule

Source§

fn clone(&self) -> FiniteQuadraticModule

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for FiniteQuadraticModule

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl PartialEq for FiniteQuadraticModule

Source§

fn eq(&self, other: &FiniteQuadraticModule) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for FiniteQuadraticModule

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.