The normalized orbit of a bounded normal operator can be a frame, providing a counterexample to Conjecture 3.
Canonical reference
ejpoleco.2025.102749 Farzanegan, M.R., Gutmann, J.,
Canonical reference. 80% of citing Pith papers cite this work as background.
1086
Pith papers citing it
1
external citations · Crossref
Background
80% of classified citations
citation-role summary
background 252
method 24
baseline 6
dataset 4
extension 2
citation-polarity summary
authors
co-cited works
representative citing papers
Machine learning methods discover a new noncrossing-partition statistic interpreting q,t-Narayana polynomials and yield a combinatorial proof of their symmetry.
SLayerGen generates crystals invariant to any space or layer group via autoregressive lattice and Wyckoff sampling plus equivariant diffusion, achieving gains over bulk models on diperiodic materials after correcting a prior loss inconsistency for hexagonal groups.
Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
A directed weighted two-graph model separates feasibility from movement in solution discovery and yields a detailed complexity classification for path and shortest-path discovery.
The method reformulates ALE mesh motion as independent multi-patch spline parameterizations per time step, using barrier functions, tangential-slip reparameterization, and constant-preserving quasi-interpolation to enable large-rotation FSI simulations.
Superconductivity in high-pressure MnB4 is induced by altermagnetic spin fluctuations, yielding extended-s pairing symmetry.
A new qubit-efficient HUBO encoding for graph partitioning problems like minimum coloring uses logarithmic bits and a lexicographic penalty to cut resources while providing provable optimality conditions.
A survey of 172 open educational datasets from 204 papers across LAK, EDM, and AIED conferences reveals trends, 143 previously uncatalogued datasets, field gaps, and an 8-item PRACTICE checklist for better data publication.
A microlocal lift of Navier-Stokes dynamics on manifolds yields an if-and-only-if geometric criterion for solution blow-up in terms of deformation integrability, directional entropy, and lifted energy.
A 9U CubeSat detector can identify a thermonuclear weapon on a satellite from 4 km away by observing spallation neutrons induced by GeV protons in roughly one week.
O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.
Introduces a method to design structure-specific relational inductive biases for a base transformer architecture, enabling end-to-end transcription of documents with intrinsic structures, demonstrated on sheet music, shape drawings, and mechanical engineering drawings.
The paper introduces a probabilistic sign rule for quotients of positive series and integral transforms that reduces monotonicity, log-supermodularity, and log-convexity to kernel sign criteria via moment identities, and applies it to derive new inequalities for hypergeometric, Stieltjes, and Prabha
The Spin-MInt algorithm is proven symplectic for general K electronic states via explicit verification of the condition MJM^T = J on the coadjoint orbit of the su(K) Lie-Poisson algebra.
The authors synthesize a typology of fourteen OSS sub-genres from a review of 3,925 papers and present a research agenda on cross-sub-genre generalization.
Structural identifiability analysis shows point sources restore identifiability for inferring spatial stochastic dynamics parameters from static snapshots, unlike distributed sources, with limits depending on modeling choices.
Maximal quantum leakage upper-bounds quantum inference accuracy; optimal encodings are pure states, with tight frames and equiangular tight frames optimal when system dimension is small.
In multistage SI(k)R models, the relationship between prevalence peak and weighted stage functional maxima varies with scaling of progression rates, converging under Erlang scaling to a delay model that justifies the factor-two approximation with error bounds and corrections.
Claims an O(n log n) (4/3)OPT + p_max algorithm for PTS that resolves a prior open question, plus faster and more general approximations for MCS.
PRISM-VO introduces photometric plenoptic bundle adjustment for drift-resilient, metric-scale visual odometry from a single focused plenoptic camera.
A learned interface-aware neural Newton preconditioner improves convergence on difficult CZM increments while preserving the original discrete solution set and force-displacement response.
ReactionAtlas is an iterative ML framework that proposes candidate reactions from seed molecules, filters them with an ML force field for valid transition states, and grows a network of ~47,000 reactions among ~12,000 compounds up to C4 in pre-biotic chemistry.
Derives leading asymptotics for collision-time tails of integrable inhomogeneous Markov chains via steepest-descent analysis and Karlin-McGregor expansion, confirming a prediction for push-block particle systems.
citing papers explorer
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.