BONDSTATSNOMINAL MATRIX

Reproducible by design.

Every analytical result in NOMINAL MATRIX is computed from user-supplied numerical conditions, using exact fixed-decimal integer arithmetic. Its purpose is to expose denomination conflicts and construct mathematically valid allocation alternatives; it is not a live security-master database or a settlement approval service.

The governing quantities

A positive holding quantity is accepted by the model if it is at least the entered minimum denomination and its difference from that minimum is an integral multiple of the specified increment. A positive transfer must meet that condition and any separately entered minimum transferable amount. A zero residual represents complete exhaustion of the holding and is allowed, but a zero transfer is never treated as an executed trade.

Holding(q) = (q ≥ min) AND ((q − min) mod step = 0)

These deliberately narrow rules do not cover alternative denomination sets, contractual exchange mechanics, instrument-specific custody conventions or the legal recognition of a historic residual generated by a corporate action. Users must verify that the chosen mathematical model correctly reflects the relevant issuer or custodian documentation.

Exact transfer topology

The central field represents two positive outgoing transfers, A and B, with a retained balance defined by position − A − B. Transfer values begin at the first allowed denomination at or above the separately entered transfer floor. The illuminated triangular envelope shows the algebraic upper bound on two transfers while retaining at least the minimum holding. The separate pale diagonal marks complete exhaustion of the position. An envelope is drawn only if the underlying modular residue allows such a retained holding.

The large numeric counts above the field are exact, not estimated from the diagram. Let T be the first permitted transfer, M the minimum denomination, S the increment and P the position. If K = (P − 2T − M) / S is a non-negative integer, the number of ordered pairs (A,B) leaving a positive permitted residual equals (K+1)(K+2)/2; otherwise this count is zero. If J = (P − 2T) / S is a non-negative integer, full-exhaustion pairs number J+1; otherwise zero. The field plots only a visual sample of discrete valid pairs, clearly distinguished from the exact counts. Direct input and keyboard navigation examine actual coordinates with integer arithmetic.

Allocation and nearest valid pairs

The allocation solver reserves minimum permissible quantities, then assigns remaining increments to the requested number of destinations while minimizing deviations from relative target weights. Its discrete optimization is followed by independent checks of every resulting quantity and a reconciliation to the exact original nominal amount. The user can retain a separate holding when the selected mode allows it.

For the dual-transfer geometry, the nearest-valid-pair function uses the triangular positive-residual region and the zero-residual diagonal. Candidate quantities are compared in exact squared integer distance, avoiding floating-point approximations of nominal amounts. Invalid conditions are withheld rather than converted into optimistic execution conclusions.

Threshold sensitivity and inverse position design

The sensitivity view varies the minimum transferable amount across 17 selected thresholds. At every threshold, the plotted quantity is the exact number of feasible ordered transfer pairs according to the same arithmetic counting formula. Only the threshold values are sampled, not the feasible pair counts.

Inverse Design solves a different question: for between two and eight outgoing transfers, and optionally a further retained holding, what is the minimum combined floor? If N outgoing transfers are required, the minimum total is N×T (plus M if a retained holding is required). A feasible allocation also requires the position and combined floors to agree modulo S. A mismatch in modular residues cannot be repaired simply by increasing the holding in whole denomination increments. The tool does not infer actual instrument eligibility from this result.

The redemption study models hypothetical proportional principal reductions at a precision of 0.01 percentage points, without inferring how a clearing system actually handles rounding, pooling, allocations or records.

Portfolio checks and audit files

The portfolio module parses up to 100 comma-separated records, each with its own position, minimum, increment, transfer threshold and proposed transfer. Row-level results are structural screens. JSON and CSV are constructed locally by the browser; exported records include the inputs and explicit non-verification language. The export deliberately does not contain an official approval or suitability conclusion.

Privacy, data and intellectual property

No external APIs, user analytics, accounts, or third-party calculation libraries are required by the instrument. Values are processed locally; optional issuer URLs are recorded as user-supplied references but never fetched or verified. Shared links embed input settings in the address fragment, so recipients can see those settings. Do not enter confidential instruments or counterparty information. The implementation, illustrations and explanatory text are original BondStats material; external sources remain linked to their publishers.

Limits of interpretation

A numerically conforming quantity is not a guarantee that an order can trade, be held, be transferred or settle. Eligibility can be affected by the security's actual terms, global-note structure, the relevant settlement system, account permissions, selling restrictions, corporate actions and market-specific requirements. The system is an independent research and scenario-analysis instrument. Confirm material legal and operational conditions with authoritative documents and qualified counterparties before using its results in practice.

Research references

ICMSA — Guide to the Treatment of Denominations and Related Exchange Conditions ↗

ICMSA — Treatment of Partial Redemptions ↗

Return to the NOMINAL MATRIX workbench ↗