The DOI matches its Crossref record.
Solution theory for complete bilinear systems of equations
Abstract
For A1,…, Am∈Mp, q(F) and g∈Fm, any system of equations of the form yTAix=gi, i=1,…, m, with y varying over Fp and x over Fq is called bilinear. Given here are some general observations about bilinear systems, a complete solution theory for complete systems (m=pq, A1,…, Am linearly independent) and implications of the complete theory for general (incomplete, m<pq) systems. Copyright © 2009 John Wiley & Sons, Ltd.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Bilinear dynamical systems may not have unique solutions, and only some types of bilinear systems have the proof of existence of solution, which are outlined by Mohler et al. (Mohler and Kolodziej, 1980), Č elikovsý et al. ( Č elikovsý and Van ěč ek, 1994) and Johnson et al. (Johnson and Link, 2009).”
From Decentralized token economy theory (DeTEcT): token pricing, stability and governance for token economies (2023) · cites this paper as Johnson and Link, 2009
Citations
Cites
No references could be resolved yet.
Cited by
Sorted by citations
Sadykhov, R., Goodell, G., De Montigny, D., Schoernig, M., & Treleaven, P. (2023) · Frontiers in Blockchain · doi:10.3389/fbloc.2023.1298330 · Cited by 7
Metadata
- Authors
- Johnson, C. R., & Link, J. A.
- Affiliations
- William & Mary (US)
- Indiana University Bloomington (US)
- Corresponding author
- Link, Joshua A.
- ORCID
- Johnson, Charles R.
- Venue
- Numerical Linear Algebra with Applications
- Publisher
- Wiley
- Published
- 2009-10-23
- Volume
- 16
- Issue
- 11-12
- Pages
- 929-934
- ISSN
- 1070-5325 (ISSN-L)
- 1099-1506
- OpenAlex
- W2152515394
- Cited by
- 11
- References
- 0
- Citations by year
- 2023: 2 · 2021: 3 · 2015: 1 · 2014: 1 · 2013: 2 · 2012: 1
- FWCI
- 0.65
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Numerical Linear Algebra with Applications (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Mathematics › Algebra and Number Theory › Rings, Modules, and Algebras
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Keywords
- bilinear systems, solution theory, finite fields, matrix equations
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review