Plasma Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 6 September
The inward particle flux, or particle pinch, is routinely observed in magnetically confined fusion experiments, yet its mechanism is not fully understood. We study the particle pinch in the tokamak edge with the flux-driven global turbulence model GDB. Starting from a flat density profile fueled only near the last closed flux surface, the simulation develops a strong inward particle flux that builds a centrally peaked density profile over $O(10)$ ms. The pinch coexists with the usual outward turbulent heat transport; two distinct mechanisms carry it. In the early stage, when density and temperature gradients oppose each other ($\eta_\alpha=L_n/L_{T_\alpha}<0$), drift-wave turbulence drives the inward flux through electron thermal diffusion. In the late stage, once the density profile has flattened, a persistent inward equilibrium $E\times B$ flux, carried by the poloidally asymmetric density and electrostatic potential, drives the central peaking. While the Pfirsch–Schlüter neoclassical transport sets the amplitude of the up-down asymmetric density, classical theory predicts no net radial flux from this asymmetry at leading order. The observed flux flows in a separate non-ideal channel, opened by parallel resistivity, electron inertia, and electromagnetic induction in the equilibrium electron force balance. This channel shifts the equilibrium potential poloidally against the density by $\delta_s\simeq-0.08\pi$ and supplies the late-phase density build-up. These results show that a flux-driven global edge simulation can self-consistently produce a centrally peaked density profile without ad hoc assumptions, and bear on longstanding edge questions such as density pedestal formation.
Programming Languages
Staged Hybrid Quantum-Classical Programming
Hybrid quantum-classical computing systems consist of a classical control system that sends quantum circuits and receives measurement results from a quantum co-processor. Such systems allow us to model algorithms that require the classical control system to generate quantum circuits on the fly, potentially based on prior measurement results. This is challenging, as the classical control system must generate quantum circuits that manipulate live quantum states. In this setting, the classical control system is generating further quantum circuits while the quantum co-processor is internally maintaining the state of the live qubits; this is not ideal, since this not only is costly but also introduces additional sources of noise to the live qubits. Thus, we want to minimize the latency between receiving measurement results and sending the next quantum circuit to be executed by pre-computing quantum circuits. We introduce HyQ (pronounced haiku), a multi-modal language based on adjoint logic that pre-generates quantum circuits before executing a hybrid quantum-classical program. We achieve this by separating our semantics into two distinct stages: 1) compile-time generation of quantum circuits and classical runtime code and 2) execution of the classical runtime code that instruments the quantum co-processor. This separation between stages allows us to formally guarantee that all circuit-generation logic occurs before the instrumentation logic, i.e., the actual runtime, and minimizes the idling of the quantum co-processor at runtime. We give a type system, a circuit-normalization semantics for the compile-time stage, which eagerly performs all circuit-generation logic, and a runtime semantics for HyQ that corresponds to the second stage. We prove type preservation and progress for both semantics.
Read the full abstract
Materials Science
Collective Excitonic Structure Governs Anomalously Weak Thermal Optical Dephasing in Conjugated Polymers
Conjugated polymer aggregates exhibit optical decoherence in the presence of strong vibronic coupling and substantial diversity in chemical structure, solid-state organization, and excitonic character. Here, we use coherence-detected and population-detected two-dimensional electronic spectroscopies to examine the temperature dependence of the homogeneous optical linewidth across a series of semiconducting polymers. Despite substantial differences in molecular architecture and solid-state organization, all polymers studied exhibit remarkably weak thermal linewidth scaling over the measured temperature range. Comparison between complementary detection modalities further shows that, while this weak temperature dependence is obust, the absolute homogeneous linewidth depends on the measured observable. This behavior reflects the different ways in which coherence- and population-detected measurements project population relaxation and pure dephasing onto the spectroscopic response. These results establish the weak thermal scaling of optical decoherence across a diverse series of conjugated polymers and show that its experimental manifestation must be interpreted in the context of the detection observable.
Read the full abstract
Analysis of PDEs
Uniform bounds for a thermo-diffusive system beyond exponential growth
In this paper, we prove a global-in-time uniform bound for solutions to a thermo-diffusive system in the whole space with bounded nonnegative initial data. The result allows exponential reaction rates and a range of superexponential rates determined by the diffusivities. This extends the recent results of La, Roquejoffre, and Ryzhik \cite{LRR24} and of Leontev and Ryzhik \cite{LR26} beyond their strictly subexponential range.
Read the full abstract
Artificial Intelligence
Simulating the Marginal Green Contribution of AI Modules in a Smart-Agriculture Platform: Evidence from Two Monte Carlo Experiments
Smart agriculture platforms usually bundle AI diagnosis, IoT sensing and decision push into a single package, so the green benefit attributable to each component remains unclear and resource-allocation decisions lack quantitative evidence. Building on a previous platform-level Monte Carlo assessment, this paper makes the components explicit and runs two controlled simulation experiments. Experiment 1 follows the chain from AI capability to farmer behavior to agrochemical input reduction, modeling pesticide/fertilizer reduction as avoidable blind-application share times prescription effectiveness times decision-touch coverage times adoption rate, and compares an experienced-extension mode with the AI mode: the probability of reaching 20% pesticide reduction is essentially zero in the extension mode but 20.7% at baseline, up to 49% with diagnosis accuracy 0.95 and adoption 0.85 under AI; the probability of 15% fertilizer reduction rises from near zero to 52.0%. Experiment 2 compares current practice (P0), IoT engineering retrofit (P1), and P1 plus AI irrigation scheduling (P2): median aggregate water saving rises from 7.8% (P0) to 11.0% (P1) and 16.0% (P2), with AI adding 5.0 percentage points beyond engineering; paddy CH4 reduction reaches 30.5% under AI scheduling versus 19.8% under manual operation, and the rice irrigation-methane subsystem carbon intensity declines 27.9%. Sensitivity analyses of both experiments consistently indicate that the primary bottleneck for meeting green targets is farmer adoption rather than algorithm accuracy, and that AI data fusion is robust to soil-moisture sensing errors. This work provides a reproducible simulation framework for component-level green-value evaluation and promotion-strategy optimization of smart agriculture platforms.
Read the full abstract
Statistics Applications
The profit-bias identity in sports betting: bookmaker profit as the public's prediction error
Sports betting moves money continuously from a large public to a small number of firms. The most influential account of that flow, due to Levitt (2004), holds that books price away from the market-clearing point to exploit predictable public biases. It computes profit from two numbers (the probability that a side wins the proposition and the fraction of handle it attracts), treating the share on a side as independent of the outcome. Here we relax that assumption and derive a profit-bias identity: profit is affine and increasing in the expected share of handle on the losing side, with Levitt's expression as the special case of independence. The identity resolves the book's margin into exactly three channels: its hold, the product of its price shading and the public's lean, and the covariance between bet share and outcome. A lean is thus worthless without shading, and shading is worthless without a lean. Under a public-belief model, the profit driver is the public's Bayes error: the probability of a representative bettor selecting the losing side. We provide necessary and sufficient conditions for a "Goldilocks Zone": prices at which book and bettor both profit. Testing these predictions on 1,139 Major League Baseball games, we find that the apparent dependence between bet share and outcome is a Simpson's paradox: present when games are pooled, but absent once they are separated by which side the book favored. The public leans heavily toward favorites, but we detect no matching shading, and the realized margin is indistinguishable from the hold.
Read the full abstract
Materials Science
Revealing the origin of ionic conduction in silver-iodide-doped silver phosphate glass
Fast ionic transport is a defining feature of many solid electrolytes, yet its microscopic origin is not fully understood. In the absence of microscopic insights, the development of next-generation solid-state batteries remains largely empirical. Most existing measurements access either the low-frequency transport response or the high-frequency bound polarization, yet the intermediate mesoscopic frequency regime is where ionic transport emerges. By varying the $\mathrm{AgI}$ concentration ($x$) and performing time-domain terahertz spectroscopy (TDTS) in a prototypical glassy electrolyte $\left(\mathrm{AgI}\right)_{x}\left(\mathrm{AgPO_3}\right)_{(1-x)}$, we reveal this intermediate frequency regime and identify a crossover from bound-current-dominated conduction to conductivity arising from short-range dispersive ionic transport. We find that bound polarization associated with the bond-bending motion of the $\mathrm{P{-}O^- -Ag^+}$ motif is present across compositions but is insufficient to produce ionic transport on its own. Transport emerges only when this polarization is embedded in a sufficiently soft $\mathrm{AgPO_3}$ glassy matrix and accompanied by a high carrier density. These ingredients together take the system from a vibrationally bound response to short-range dispersive motion.
Read the full abstract
Artificial Intelligence
Monte Carlo-Based Ex-Ante Assessment of the Green Benefits of an AI-Driven Smart Agriculture Platform in Hainan
Smart agriculture platforms are widely regarded as key carriers for implementing China's pesticide and fertilizer reduction, water-saving and carbon-reduction agendas, yet a unified quantitative framework for assessing their green value is still lacking. Taking an AI-driven decision platform for tropical agriculture as the object (integrating large-language-model question answering, multimodal pest diagnosis, IoT sensing, satellite remote sensing, and a closed-loop field record system), this study builds a cradle-to-farm-gate agricultural carbon accounting model covering pesticide and fertilizer production, field N2O, irrigation electricity and paddy CH4, translates platform interventions into quantifiable transmission parameters, and propagates parameter uncertainty by Monte Carlo simulation over three Hainan scenarios (mango, winter vegetable, rice/nanfan, area-weighted 40%:30%:30%). Under full adoption, median reductions are 23.5% (90% interval 15.0%-33.2%) for pesticide use, 21.0% (13.8%-28.9%) for fertilizer, 16.5% (10.9%-23.5%) for irrigation water, and 21.5% (16.1%-27.2%) for carbon intensity. Attainment probabilities are high for fertilizer reduction >=15% (90.6%) and clear carbon decline (98.1%), but only about 20% for aggregate water saving >=20%, favoring scenario-specific statements. Sobol first-order indices show soil-test recommendation and organic substitution jointly explain about 83% of the variance of aggregate carbon-intensity reduction. Convergence tests show 10,000 iterations stabilize all statistics; conservative/baseline/optimistic scenario bounds are reported. The framework offers a reproducible, calibration-ready methodology for ex-ante green-value assessment and pilot observation design.
Read the full abstract
Complex Variables
Invariants of singular germs of real-analytic sets
New biholomorphic invariants of a germ of a real-analytic set at a singular point (either an RC-singular point or a singular point of a smooth structure) are found: the Bloom-Graham singular type and the singular l-type. Their construction is based on the Bloom-Graham type and l-type constructions, respectively. A series of examples is considered.
Read the full abstract
Probability
Identifiability of finite-state $\epsilon$-machines from finite summaries
We study how much observable finite-dimensional information is sufficient to identify a finite-state generator $\epsilon$-machine. The observable summaries are labeled tables of conditional probabilities given finite histories and contiguous block laws. For stationary ergodic finite-alphabet processes, we first prove that a table with past horizon $L$ and future horizon $R$ is equivalent to the block law of length $L+R$. We then recall the classical linear-realization bound. Two hidden Markov presentations with $r$ and $s$ states agree on the entire process law if they agree on words through length $r+s-1$. Our main result gives a structural synchronization bound adapted to exact finite-state generator $\epsilon$-machines. If their target synchronization radii are $a$ and $b$, and their maximum predictive separation radius is $d$, then equality of one block law of length $a+b+d+1$ implies isomorphism. The proof aligns the states of both machines with words that synchronize the two generators simultaneously. For the full-support binary context subfamily of order $m$ with pairwise distinct parameters, the structural synchronization bound is $2m+2$, whereas the state-count and rank-dimension forms of the classical linear-realization bound are $2^{m+1}-1$. A construction shows that a horizon of order $m$ is necessary. When the order-$m$ context structure is known in advance, the sharp horizon is $m+1$ symbols. Thus the raw state-count and rank-dimension formulas can be exponentially pessimistic on this subfamily. The comparison is between general sufficient bounds, not with an optimal realization horizon.
Read the full abstract
High Energy Physics (Phenomenology)
Inverse-seesaw and inflationary scale relations in a supersymmetric 331 model from an SU(6) GUT model
We propose a $N=1$ supersymmetric $SU(6)$ theory with an intermediate $(SU(3)_C\times SU(3)_L\times U(1)_X)$ phase, in which common fields and operators relate the neutrinos, gauge mediation, unification, and symmetry-breaking sectors. The antisymmetric Dirac matrix of the inverse-seesaw sector has rank two, yielding one vanishing light-neutrino mass at leading order. A higher-dimensional symmetry-breaking correction lifts this zero mode through its projection onto the left and right null vectors of the Dirac matrix, leading to a quartic suppression in the ratio of the intermediate and ultraviolet scales. Complete unified messenger multiplets preserve the relative one-loop gauge coupling evolution while modifying the unified coupling. When the same supersymmetry-breaking spurion generates the singlet lepton-number-violating parameter, an analytical relation emerges between the messenger scale, the lepton-number mediator scale, and the unified coupling. The two-loop gauge evolution remains perturbative for the assumed heavy-threshold spectrum. In the inflationary sector, the scalar-amplitude normalization determines the coupling governing both the inflationary potential and the radial scalar mass in the broken vacuum. The physical scalar directions transverse to the inflaton are stable within the neutral supergravity subspace, while the combined inflationary and gauge-mediated conditions imply a significant sensitivity of the symmetry-breaking vacuum. An examination of the allowed operators shows that additional ultraviolet conditions are required to obtain the observed active-neutrino mixing, suppress competing lepton-number-violating terms, and complete the heavy-field spectrum. Our analysis establishes the analytical scale relations among the neutrino, messenger, unification, and inflationary sectors and identifies the conditions necessary for their simultaneous realization.
Read the full abstract
Computer Vision
LASSNet: Level-Aware Availability-Conditioned Spatial-Semantic Fusion for Brain Tumor Segmentation with Missing MRI Modalities
Brain tumor segmentation from multimodal MRI relies on complementary evidence across four imaging sequences, yet one or more modalities may be unavailable because of acquisition cost, protocol variation, scan failure, or patient condition. Existing work has explored reconstruction, knowledge transfer, and direct feature fusion, but leaves open whether missing-modality fusion should change with representation level. High-resolution lateral features retain spatial detail, whereas compressed bottleneck features encode semantic and inter-modality context. We therefore hypothesize that fusion should be conditioned jointly on modality availability and feature hierarchy. We propose the Level-Aware Availability-Conditioned Spatial-Semantic Fusion Network (LASSNet), which contains two level-specialized modules. Hierarchical Availability-Conditioned Fusion (HACF) constructs four lateral representations using count-normalized aggregation of available modalities, mask-conditioned channel modulation, and local 3D refinement. Tri-Scale Relational-Spatial Fusion (TriRSF) models relations among available modality descriptors and spatial context across multiple bottleneck resolutions, followed by cross-scale aggregation and availability-conditioned global spatial attention. A shared coarse-to-fine decoder starts from TriRSF semantics and progressively injects HACF features, without reconstructing missing inputs. Across all 15 non-empty modality configurations, LASSNet obtains mean Dice scores of 76.7% and 83.2% over WT, TC, and ET on BraTS2019 and BraTS2023, respectively.
Read the full abstract
Analysis of PDEs
Global Strong Solutions for Maxwell-Stefan Diffusion with Additive Friction Coefficients
We study Maxwell-Stefan diffusion with additive friction coefficients $f_{ij}=g_i+g_j$. In mass fractions, the system isolates the constrained pair-friction block; in mole fractions, it is the classical ideal isothermal/isobaric Maxwell-Stefan system at constant total molar concentration. Additivity makes the constrained pair-friction dissipation species-diagonal; conversely, species-diagonality on one interior barycentric constraint space forces a pair-sum representation. At operator level, the positive constrained relaxation operator is a scalar shift of a compression of $G=diag[g_1,\ldots,g_N]$. Its scalar resolvent yields both an explicit constrained inverse and interlacing spectral roots, which form global real-analytic coordinates on the open simplex and whose differentials are left eigen-covectors. In root coordinates the principal part is diagonal, no self-square gradient term occurs, and scalar comparison yields invariant rectangles and separation from the simplex boundary. For regularity we introduce entropy-stabilized one-sided multi-EPD truncations: Euler-Poisson-Darboux entropies cancel mixed quadratic production, while for $N\ge4$ a truncation-weighted mixing-entropy correction supplies transverse coercivity. Caccioppoli and logarithmic estimates, shrinking, and critical mass yield Hölder continuity up to the Neumann boundary. The mixing entropy also symmetrizes the moment system; frozen conormal estimates give spatial Lipschitz bounds. Together with time Hölder control and short-interval maximal regularity, this yields global strong solvability on bounded $C^{2+\alpha}$ domains with $0<\alpha<1$, for each $N\ge2$, $d\ge2$, and $p>d+2$, for all uniformly positive, compatible initial concentrations in the natural trace class. Solutions become classical for positive times and converge exponentially to equilibrium in relative entropy, $L^2$, and $C^1(\bar\Omega)$.
Read the full abstract
Computation and Language
Event Interaction in Low-Rank Bottlenecks for Temporal Relation Extraction
Temporal relation extraction determines whether an event occurs before, after, or simultaneously with another event, and therefore relies on accurately modeling how the two events interact. Mainstream systems achieve this by concatenating event spans or using shallow fusion, which works well when all model parameters are trainable. However, in parameter-efficient fine-tuning, low-rank bottlenecks restrict information flow and prevent these interaction signals from passing through, leading to clear performance drops. To address this limitation, we propose a theoretically grounded architecture, Convolutional Bottleneck Interaction (CBI), which first applies lightweight depthwise convolution to enhance event representations and then uses element-wise multiplication to capture effective event-event interactions inside the bottleneck. Across five datasets and seven backbone models in the Adapter and LoRA settings, CBI provides consistent and substantial gains, up to +31.7 micro F1, while adding minimal computational cost, showing that explicit interaction inside low-rank spaces is crucial for temporal relation extraction. The code is available at https://github.com/VRCMF/CIF.git.
Read the full abstract
Combinatorics
A dot-product bound from separate growth-minimizing bases
For every finite $P\subset\mathbb{R}^2$ we prove $|\{p\cdot q: p,q\in P\}|\gg |P|^{199/295}$, with an absolute constant and no logarithmic loss, where $199/295 = 2/3+7/885$. This improves the bound $2/3+7/1425$ of Kokkinos (arXiv:2502.12727), which in turn had improved the first superthreshold bound of Hanson, Roche-Newton, and Senger. The main new ingredient is the inequality $|F^{(2)}G^{(2)}/(F^{(2)}G)| \le |AB|(|AF|/|A|)^4(|BG|/|B|)^3$: each radial profile retains its own Petridis growth-minimizing subset, and the product of the two subsets serves as a common base for both growth operators; a prime-power construction shows this is sharp under its hypotheses. The second ingredient is a weighted-median replacement for the dyadic selection in the squeezing argument of Roche-Newton and Wong, upgrading their seven-factor expander to a logarithm-free form; an appendix gives the complete proof from the Solymosi-Zahl incidence theorem. We complement the lower bound with a third-moment structure theorem for near-extremal configurations and a construction showing that the pinned problem admits no linear lower bound: $\max_{p\in P}|p\cdot P| = O(|P|/\sqrt{\log |P|})$ is attainable. The algebraic core, the median lemma, the surface identities, and the pinned construction are formally verified in Lean 4 and included as ancillary files.
Read the full abstract
Computer Vision
Uni-Light: An Ultra-Lightweight Framework via Uncertainty-Aware Knowledge Distillation for Brain Tumour Segmentation
Accurate 3D brain tumour segmentation from multi-modal Magnetic Resonance Imaging (MRI) is essential for clinical diagnosis and treatment planning. Existing brain tumour segmentation methods often suffer from heavy computational demands, while current lightweight architectures frequently lack the capacity to maintain segmentation fidelity in complex tumour regions. To address these issues, we propose a novel ultra-lightweight framework (Uni-Light) that achieves high-fidelity segmentation with substantially reduced computational overhead. It combines multi-scale convolutions with an uncertainty-aware knowledge distillation scheme that directs the student model toward hard-to-classify regions, complemented by a Signed Distance Field boundary loss for geometric constraints. Experimental results on BraTS2023-GLI and MSD-BTS datasets demonstrate that Uni-Light reduces parameters by 97.56%, floating-point operations (FLOPs) by 73.03%, and inference memory footprint by 81.58%, while surpassing the state-of-the-art model by an average of 1.47% in Dice score, offering a highly competitive trade-off between segmentation accuracy and computational efficiency in resource-constrained clinical settings. This work also advances data engineering for medical imaging by demonstrating that teacher model uncertainty can be exploited as a data-driven supervisory signal, re-prioritising the training data distribution without requiring additional annotation.
Read the full abstract
General Relativity and Quantum Cosmology
Physics-based phenomenological modeling of binary black hole hierarchical formation 2: Autodifferentiable functional inference of hierarchical compact-binary populations
The gravitational-wave (GW) census contains mass and spin structure consistent with contributions from black holes assembled through repeated mergers in dense environments. Connecting that structure to formation physics requires models that are both physically interpretable and tractable within population inference. We construct an autodifferentiable, physics-based phenomenological model in which each dense environment is represented by a coagulation response and a population of such environments produces an observable merger-rate density. Embedded in the gwkokab Poisson-likelihood framework, this model enables joint inference of natal-population and interaction parameters from the GW census. Applied to GWTC-5.0, the framework shows why simple pairwise coagulation models struggle to reproduce the observed high-mass, comparable-mass population and tests alternative interaction structures against the data, while retaining an explicitly modeled natal component.
Read the full abstract
Statistics Theory
Phase transitions and approximations of mean squared error for state-space models with fractional differencing
We study trend estimation in state-space models in which the trend has a fractional stochastic difference of order $d>0$ and the observation errors form a short-range-dependent stationary process. Using finite-sequence fractional summation and differencing operators, we analyze the penalized least-squares estimator obtained by shrinking the fractional differences of the trend. We derive asymptotic mean squared error (MSE) approximations for all $d>0$ and identify a sharp phase transition at $d=1/2$. When $d>1/2$, the estimator is consistent and its optimally balanced MSE has order $n^{-(2d-1)/(2d)}$. At the boundary $d=1/2$, we obtain a refined finite-sample approximation and show that the MSE decreases at the slower order $\log\log n/\log n$. When $0<d<1/2$, the MSE converges to an explicit positive limit, so consistent recovery of the trend is impossible under the considered scaling. We also describe a practical criterion for choosing the penalty parameter and differencing order, and numerical experiments illustrate the MSE approximations and the behavior of the selection procedure.
Read the full abstract
Computer Vision
Back to the Feature: Zero-Shot 6DoF Pose Estimation via Dense Local Features
We present B2TFPose, a training-free zero-shot method for 6DoF pose estimation of unseen objects from RGB images. Using a single frozen DINOv3 vision transformer as its only pretrained component within the pose estimation pipeline, B2TFPose extracts dense patch-level features that generalize across the synthetic-to-real domain gap without any task-specific fine-tuning, revisiting the classical local feature matching paradigm through the lens of large-scale self-supervised foundation models. Three contributions advance the training-free state of the art. A geodesic non-maximum suppression strategy retrieves a viewpoint-diverse template set for coarse-to-fine correspondence matching. Render-guided Re-Correspondence (RRC) synthesizes object-specific views at the estimated pose and re-establishes dense 2D-3D correspondences to sharpen the initial estimate without additional learned parameters. A multi-mask hypothesis selection strategy jointly scores competing segmentation candidates to resolve segmentation ambiguity. On the seven core datasets of the BOP Benchmark, B2TFPose achieves 40.7 mean AR without refinement and 56.4 with refinement, establishing state-of-the-art performance among training-free RGB methods and outperforming trained counterparts including GigaPose and GenFlow, at competitive inference speed.
Read the full abstract
Computational Complexity
A Lower Bound of 21 for $3\times3$ Matrix Multiplication over $\mathbb{F}_2$
We prove that $3\times3$ matrix multiplication over $\mathbb{F}_2$ has bilinear complexity at least $21$, improving the previous lower bound of $20$. Lower bounds for restrictions of the first input constrain how many first factors of a decomposition can lie in each subspace. For a hypothetical $20$-term decomposition, the strengthened restriction bounds force all first factors of matrix rank at least two into a single coset of a three-dimensional rank-one subspace. An exhaustive computation finds no admissible first-factor profile with $20$ terms. We also prove that $2\times3$ by $3\times3$ matrix multiplication over $\mathbb{F}_3$ has rank exactly $15$: three profiles with $14$ terms survive the corresponding computation up to symmetry, and short restriction arguments exclude them. We combine Wang's automated framework for tensor-rank lower bounds with D'Ambrosio's capacity-and-profile strategy. Our computational contributions are rank-one-span searches that strengthen the subspace lower-bound table and a direct, symmetry-reduced profile enumerator that enforces all subspace capacities simultaneously.
Read the full abstract
Combinatorics
Cyclic Incidence Orderings of Complete Graphs and 3-Uniform Hypergraphs
We study cyclic orderings of all edges of a complete $k$-uniform hypergraph on $n$ vertices in which the binary incidence sequences of the vertices are cyclic shifts of a common word. The shifts are chosen independently, with no prescribed action on the vertices. For $2\leq k<n$, coprimality $\gcd(n,k)=1$ is known to suffice even when consecutive edges must differ by a single vertex exchange. We recall a short orbit construction and prove the converse for the first two nontrivial uniformities without any adjacency requirement. For $k=2$, an ordering exists exactly when $n=2$ or $n$ is odd; for $k=3$, exactly when $n=3$ or $3\nmid n$. The necessity proofs use reflected convolution identities and pair-intersection counts to constrain the vertex shifts to a torsion coset. For triples, multiplicity-preserving dilation and conditional prime-power capacity bounds complete the argument.
Read the full abstract
Computer Vision
ADELE - Adaptive Delaunay Grids for High-Fidelity Mesh-Native Reconstruction
Meshes remain the most practical representation for geometry reasoning and integration into graphics pipelines, yet existing reconstruction methods struggle to produce high-quality meshes. Most state-of-the-art approaches initially learn an intermediate representation (NeRF/3DGS) and treat mesh extraction as a post-processing step, which often leads to oversmoothed surfaces or poor quality meshes with excessive triangle counts.Existing mesh-native optimization methods alleviate some of these issues but suffer from fixed-resolution discretizations and unstable optimization behavior. In this paper, we introduce an adaptive mesh-based optimization framework and a practical mesh rendering technique to address these challenges. Our representation combines an optimizable Delaunay-triangulated tetrahedral grid with a multi-resolution hash grid. The former is refined through point pruning and insertion, while the latter provides latent features for SDF/appearance value predictions. We use volumetric rendering to bootstrap a coarse geometry while leveraging mesh-based rendering for recovering fine-grained details. Additionally, we propose a differentiable, rasterization-based depth-offset rendering formulation, reducing geometric artifacts and improving reconstruction quality. Our method significantly outperforms existing mesh optimization approaches across a variety of object-centric benchmarks while being competitive with state-of-the-art NeRF/3DGS methods.
Read the full abstract
Soft Condensed Matter
Activity enhances heterogenous dynamics in 2D granular glasses
We study the effect of self-propulsion in the approach to the glassy regime of 2D bidisperse mixtures of frictional discs, confined to a horizontal plane, and fluidized by vertical vibrations. The discs are designed either to be passive, that is, exhibiting isotropic motion in the plane, or active, with a preferred polar mobility. When dynamics in mixtures of large active and small passive discs are compared to mixtures of large and small passive discs, the active system shows faster dynamics at equal area fractions. To explore whether activity merely speeds up motion, we select active and passive mixtures with the same relaxation time and compare their dynamics. Many indicators show that dynamical heterogeneity is much greater in the active glass with longer-ranged spatial velocity correlations, larger temporal variations in displacement, and higher amplitude of the four-point correlator. In this very crowded regime, despite frequent collisions, the activity directions of the discs remain persistent. However, the activity direction of the discs remains spatially uncorrelated, and furthermore, the particle displacements are not aligned with the activity direction, thus presenting a puzzle as to how activity leads to such strong heterogeneity.
Read the full abstract
Computer Vision
Companion-style QA Assistance in Ego-Vision
AI companions are envisioned as always-on assistants that support users in daily life. With this regard, we introduce BuddyVQA, a benchmark for companion-style question answering (QA) on egocentric streaming video. BuddyVQA contains 21.6K questions linked to 6K highlight moments across 1,012 long, egocentric videos. It features two key characteristics that are common in daily first-person QA assistance but are largely overlooked in existing VideoQA benchmarks: ego-deictic expressions and interactively chained questions (e.g., "Where is it?", "How to get there?"). These require models to infer a user's in-situation intent by resolving visual pronouns in the context of egocentric visual and QA contents, with both grounded in a long-form streaming setting. To tackle the challenges, we propose MyBuddy, a companion-style QA assistant that highlights a multimodal chain-of-thought reasoning mechanism to infer the final answer based on the historical QA and visual content. An additional question filter and multi-level memory are designed to facilitate efficient QA and visual information retrieval under streaming QA settings. Experiments show that MyBuddy significantly enhances the performance of foundation models on BuddyVQA. Moreover, these gains generalize to other streaming and common video QA benchmarks, demonstrating the applicability and effectiveness of our approach. Our code and dataset are available at https://github.com/QHUni/BuddyVQA
Read the full abstract
Software Engineering
An Autonomy Aware Metamodel for Human AI Collaboration in Software Engineering
Artificial Intelligence (AI) is shifting software engineering from tool-supported processes towards AI-first collaboration, where authority is dynamically distributed across human and artificial actors. However, existing method engineering approaches assume static, human-centric control and provide limited support explicitly capturing evolving autonomy. This paper presents a vision for autonomy-aware method engineering by proposing a metamodel that treats autonomy not as a fixed property of an actor, but as a derived, situation-dependent authority assignment determined by task, context, and collaboration pattern. The metamodel formalizes autonomy through four authority dimensions: task execution, task decomposition, task initiation, and collaboration reconfiguration. Through an analytical instantiation with a multi-agent requirements analysis tool, we illustrate how the metamodel supports dynamic authority assignment. This work provides a conceptual foundation for governance-aware, adaptable, and AI-first software engineering methods.
Read the full abstract
Representation Theory
Invariant Jacobian and the Center of a Homogeneous Form
We study homogeneous forms with invariant Jacobian under group actions. For finite-dimensional irreducible complex representations, we show that the canonical decomposition defined by the center of the form is either trivial or gives a system of imprimitivity, which determines the module structure of Jacobian $J(f)$. We apply the theory to symmetric groups and classify homogeneous forms with invariant Jacobian on the natural permutation module.
Read the full abstract
Robotics
SkillX: Unified Multi-Skill Policy Learning for Humanoid Soccer
Humanoid soccer is a challenging testbed for dynamic whole-body control, requiring robots to coordinate balance, locomotion, object interaction, and skill switching over long horizons. Existing humanoid sports methods often rely on task-specific multi-stage pipelines, making it difficult to jointly learn and compose multiple object-interactive skills within a single deployable policy. To address this, we present SkillX, a unified reinforcement learning framework that learns and composes multiple atomic soccer skills through a single command-conditioned policy. SkillX integrates three core designs: skill-specific adversarial motion priors, skill-specific critics, and an object-aware temporal encoder, enabling the robot to execute atomic skills and transition among them such as dribbling, trapping, and shooting. Experiments in simulation and on a real Noetix E1 humanoid demonstrate robust multi-skill execution, long-horizon skill composition, and successful sim-to-real deployment.
Read the full abstract
Combinatorics
Residual structure and growing inversion-monotonicity regions for 1324-avoiding permutations
Let $a(n,k)$ be the number of $1324$-avoiding permutations of length $n$ with $k$ inversions. Linusson and Verkama proved $a(n,k)\le a(n+1,k)$ for $k\le2n-7$. We study the obstruction beyond that line: the residuals $\mathcal R_{\delta,n}$, namely the indecomposable, non-almost-decomposable avoiders at defect $\delta=k-2n+7$. Contracting maximal increasing consecutive runs reduces residuality to a quadratic equation on a finite family of skeletons. It follows that, for every fixed $\delta$, the eventual count has the form $|\mathcal R_{\delta,n}|=A_\delta n^2+B_\delta n+C_\delta$. Our central uniform result determines the quadratic coefficient at every defect: with $P(q)=\prod_{j\ge1}(1-q^j)^{-1}$, $\sum_{\delta\ge0}A_\delta q^\delta=4q^3(1+q)P(q)^2/(1-q)^2$. This is a formula for the leading coefficient of the residual count, not for the full count. The same structural estimates give computer-assisted proofs of $a(n,k)\le a(n+1,k)$ for every $n\ge1$ and $k\le2n+6$, and of regions whose width grows with $n$: for $n\ge2^{16},2^{18},2^{20}$ the defect may be as large as $\lfloor\sqrt n/4\rfloor$, $\lfloor\sqrt n/3\rfloor$, $\lfloor\sqrt n/2\rfloor$, respectively. More generally, every fixed $c<\sqrt2\log(5)/\log(68)$ is admissible for all sufficiently large $n$. The three added fixed defects $11,12,13$ use complete catalogue and rational-sum certificates supplied in the accompanying archival supplement. The leading-coefficient theorem is obtained from a complete finite classification of marked rank-three cores and all-parameter extension lemmas. We also determine the exact rank-three stabilization onset, while keeping it separate from the still unknown onset of the complete residual count. The unrestricted Claesson–Jel'inek–Steingr'imsson conjecture, the full residual polynomials, and the sharp global base-length bound remain open.
Read the full abstract
Systems and Control
Moment Matching for Descriptor Systems: A Möbius Mapping Approach
For a class of single-input single-output systems described by proper or improper transfer functions, we propose moment-matching procedures applicable in both continuous- and discrete-time contexts. The resulting technique is not only more flexible and reliable than other procedures which are currently available in literature, but it also enables the placement of constraints on the reduced-order model's poles and zeros. This constraint-based feature, hitherto available only for continuous-time state-space systems, is illustrated via a numerical example based on a practical problem from literature.
Read the full abstract
Artificial Intelligence
We Built a Mirror and Mistook It for a Mind: Causal Liability and the Fallacy of AI Consciousness
The contemporary debate over machine consciousness begins from a concealed assumption: that the object called "AI" already constitutes the kind of entity to which consciousness could belong. This paper challenges that assumption by separating phenomenal consciousness, introspective report, and human projective introspection, then arguing that generative systems can return linguistic traces of human interiority in first-person form without thereby identifying a phenomenal bearer. We call the resulting inference the AI Consciousness Fallacy. We then introduce Causal Liability Theory (CLT). CLT-I proposes liability closure as a criterion for individuating a candidate bearer: a physically continuing process becomes the non-delegable inheritor of constraints generated by its own endogenous discriminations. CLT-II advances the stronger conjecture that liability closure is necessary and sufficient for minimal phenomenal subjecthood. An open-weight causal audit operationalizes CLT-I across multiple model families. Forced discriminations produced persistent downstream divergence; activation patching showed strong causal mediation; live and copied adaptive states were behaviorally identical under matched randomness; and detached reconstruction preserved computational state across process replacement while, by protocol, breaking constitutive continuity and non-delegable inheritance. These results show that CLT-I distinctions are experimentally tractable and can dissociate causal bearer structure from first-person performance. The framework therefore separates consciousness attribution, causal bearer individuation, and the independent metaphysical question of consciousness constitution.