Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 18 February

General Mathematics

Representation of similar triangles in $\mathbb{R}^{3}$

In 1994, Dhar and Sinha provided a graphic representation in $\mathbb{R}^{2}$ of the classification of triangles based on similarity. In this article, we briefly recall their treatment and offer a generalization by providing a graphic representation in $\mathbb{R}^{3}$. Towards the end of this article, we make an attempt to offer a quantitative analysis of some particular class of triangles.
Read the full abstract

General Mathematics

Chebyshev polynomials and a refinement of the local residue/non-residue structure at a prime

The basic power function $t_n(x)=x^n$ is in some sense a classical limit for large $x$, of the monictised Chebyshev polynomial of the first kind $T_n(x)/2^{n-1}$. A theorem of Ritt says they are the only two families of polynomials $p_n(x)$ over $\mathbb{C}$ which satisfies the commutativity relation $p_n(p_m(x))=p_m(p_n(x))$. The commutativity $t_n(t_m(x))=t_m(t_n(x))$ is the reason why the RSA scheme allow also digital signature but the Diffie-Hellman key exchange protocol depends only on the commutativity. The DH scheme and many results in elementary local (at a fixed prime) multiplicative number theory is about properties of the power function $t_n(x)$ and they have natural analogue extension to $T_n(x)$. Recently we discovered a Chebyshev version of Euler's primality criterion , which however depends on two quadratic characters $\epsilon_p(a)=\left ( \frac{a^2-1}{p} \right)$ and $\delta_p(a)=\left( \frac{2(a+1)}{p} \right)$. This gives rise to a local partition of $(\mathbb{Z}/p\mathbb{Z}) \setminus \{ \pm 1 \}$ into 4 disjoint sets $A_{\epsilon \delta}$. This can be thought of as a real refinement of the residue/non-residue as it arise from viewing $T_n(x)$ is the "real" part of the $n$th power of the unit $\omega_x=x+\sqrt{x^2-1}$, namely $\omega_x^n=T_n(x)+U_{n-1}(x)\sqrt{x^2-1}$. There are obvious analogue of Chebyshev version of pseudoprimes, Wieferich primes, Lucas-Lehmer, AKS, Diffie-Hellman, cyclotomic expansions and probably others.
Read the full abstract

General Mathematics

Applications of Fractal Sumudu Transform in Economic Models

In this paper, we present a new fractal derivative with a nonsingular kernel and analyze its fundamental properties. The effectiveness of the proposed operator is illustrated through the study of economic models using both the Caputo fractal derivative and the new fractal derivative.
Read the full abstract

Information Theory

Greedy Multi-Path Block Verification for Faster Decoding in Speculative Sampling

The goal of $L$-step speculative decoding is to accelerate autoregressive decoding of a target model by using a cheaper draft model to generate a candidate path of $L$ tokens. Based on a verification algorithm involving target and draft model probabilities, a prefix of the candidate sequence is accepted, and an additional correction token is sampled from a residual distribution to ensure that the final output adheres to the target distribution. While standard speculative decoding uses a verification algorithm which is independent at each token on the path, a recent extension called block verification uses a joint condition involving all sampled on-path probabilities. Block verification (BV) was shown to be optimal over all verification algorithms which use only on-path probabilities, improving on standard speculative decoding. In this work, we first show that block verification is optimal even over verification algorithms that use off-path probabilities, by constructing an information-agnostic linear program (LP). Further, we can extend our LP to the setting where the draft model samples multiple candidate paths, and use it to construct a natural class of multi-path block verification generalizations. While computing the optimal algorithm in this class is not tractable, by considering a stricter class of greedy algorithms, we can formulate an efficient method called greedy multi-path block verification (GBV). Empirically, GBV can improve block efficiency by over 30% and reduce decoding walltimes by over 15% relative to BV. On Llama-3 70B, GBV can improve the end-to-end decoding throughput over SOTA multi-path verification methods by more than 15%.
Read the full abstract

Algebraic Geometry

On rational chain connectedness of globally +-regular varieties

We prove that globally $+$-regular varieties are rationally chain connected in dimension three and mixed characteristic with residue field characteristic $p>5$. We also introduce a notion of strongly globally $+$-regular, and show that varieties of arbitrary dimension which are strongly globally $+$-regular over a dense open subset of $\mathrm{Spec}(\mathbb{Z})$ are rationally chain connected.
Read the full abstract

All authors Emre Alp Özavc{\i}, Zsolt Patakfalvi, Kevin Tucker, Joe Waldron, Zheng Xu

Algebraic Geometry

The GKZ hypergeometric $\mathcal D$-module

For an $(n\times N)$-matrix $A$ of rank $n$ with integer entries, Gelfand, Kapranov and Zelevinsky introduce a system of differential equations, called the $A$-hypergeometric system. We define the stable GKZ hypergeometric $\mathcal D$-module using cohomological functors, which is closely related to the $A$-hypergeometric $\mathcal D$-module and the $\mathcal D$-module underlying the better behaved GKZ system introduced by Borisov and Horja. We prove the stable GKZ hypergeometric $\mathcal D$-module is holonomic and is an integrable connection of rank $n!\mathrm{vol}(\Delta_\infty)$ on the Zariski open subset parametrizing nondegenerate Laurent polynomials, where $\Delta_\infty$ is the Newton polytope at $\infty$.
Read the full abstract

Analysis of PDEs

Self-similar extinction for a fast diffusion equation with weighted absorption

Finite time extinction of any bounded solution to the fast diffusion equation with spatially inhomogeneous absorption $$ \partial_tu=\Delta u^m-|x|^{\sigma}u^p, \quad (x,t)\in\mathbb{R}^N\times(0,\infty), $$ with $N\geq1$ and exponents $$ p>1, \quad m_c=\frac{(N-2)_+}{N}<m<1, \quad \sigma>\sigma_*:=\frac{2(p-1)}{1-m}, $$ is established. Moreover, the existence of self-similar solutions of the form $$ U(x,t)=(T-t)^{\alpha}f(|x|(T-t)^{\beta}), \quad \alpha=\frac{\sigma+2}{(1-m)(\sigma-\sigma_*)}, \ \beta=\frac{p-m}{(1-m)(\sigma-\sigma_*)}, $$ with $f(0)>0$, $f'(0)=0$ and $$ \lim\limits_{\xi\to\infty}\xi^{(\sigma+2)/(p-m)}f(\xi)=L\in(0,\infty). $$ is proved, together with some unbounded self-similar solutions as well. The property of finite time extinction is in striking contrast to the standard fast diffusion equation with absorption (that is, $\sigma=0$), where the strict positivity of solutions for any $t\in(0,\infty)$ is well-known.
Read the full abstract

Probability

Once-excited random walks on general trees

We study once-excited random walks on general trees, modeled by placing a single "cookie" at each vertex. Each cookie acts as a metaphorical reward that is consumed upon the first visit to the vertex where the cookie is placed. On that initial visit, the walk is in an excited state and behaves like a biased random walk. Once the cookie is consumed, the process reverts to a symmetric random walk on all subsequent visits. We consider a random environment in which the bias parameters are independent random variables. We prove that the process exhibits a sharp phase transition between transience and recurrence on general trees with polynomial growth, where the critical threshold is determined by the branching-ruin number of the tree.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

M-estimation under Two-Phase Multiwave Sampling with Applications to Prediction-Powered Inference

In two-phase multiwave sampling, inexpensive measurements are collected on a large sample and expensive, more informative measurements are adaptively obtained on subsets of units across multiple waves. Adaptively collecting the expensive measurements can increase efficiency but complicates statistical inference. We give valid estimators and confidence intervals for M-estimation under adaptive two-phase multiwave sampling. We focus on the case where proxies for the expensive variables – such as predictions from pretrained machine learning models – are available for all units and propose a Multiwave Predict-Then-Debias estimator that combines proxy information with the expensive, higher-quality measurements to improve efficiency while removing bias. We establish asymptotic linearity and normality and propose asymptotically valid confidence intervals. We also develop an approximately greedy sampling strategy that improves efficiency relative to uniform sampling. Data-based simulation studies support the theoretical results and demonstrate efficiency gains.
Read the full abstract

Probability · Cross-listed from quant-ph

Adaptive Aborting Schemes for Quantum Error Correction Decoding

Quantum error correction (QEC) is essential for realizing fault-tolerant quantum computation. Current QEC controllers execute all scheduled syndrome (parity-bit) measurement rounds before decoding, even when early syndrome data indicates that the run will result in an error. The resulting excess measurements increase the decoder's workload and system latency. To address this, we introduce an adaptive abort module that simultaneously reduces decoder overhead and suppresses logical error rates in surface codes and color codes under an existing QEC controller. The key idea is that initial syndrome information allows the controller to terminate risky shots early before additional resources are spent. An effective scheme balances the cost of further measurement against the restart cost and thus increases decoder efficiency. Adaptive abort schemes dynamically adjust the number of syndrome measurement rounds per shot using real-time syndrome information. We consider three schemes: fixed-depth (FD) decoding (the standard non-adaptive approach used in current state-of-the-art QEC controllers), and two adaptive schemes, AdAbort and One-Step Lookahead (OSLA) decoding. For surface and color codes under a realistic circuit-level depolarizing noise model, AdAbort substantially outperforms both OSLA and FD, yielding higher decoder efficiency across a broad range of code distances. Numerically, as the code distance increases from 5 to 15, AdAbort yields an improvement that increases from 5% to 35% for surface codes and from 7% to 60% for color codes. To our knowledge, these are the first adaptive abort schemes considered for QEC. Our results highlight the potential importance of abort rules for increasing efficiency as we scale to large, resource-intensive quantum architectures.
Read the full abstract

All authors Sanidhay Bhambay, Prakash Murali, Neil Walton, Thirupathaiah Vasantam

Category Theory · Cross-listed from quant-ph

Free Quantum Computing

Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be clarified by free models, that add to classical computing just enough physical principles to represent quantum computing and no more. Here we develop an axiomatisation of quantum computing that replaces the standard continuous postulates with a small number of discrete equations, as well as a free model that replaces the standard linear-algebraic model with a category-theoretical one. The axioms and model are based on reversible classical computing, isolate quantum advantage in the ability to take certain well-behaved square roots, and link to various quantum computing hardware platforms. This approach allows combinatorial optimisation, including brute force computer search, to optimise quantum computations. The free model may be interpreted as a programming language for quantum computers, that has the same expressivity and computational universality as the standard model, but additionally allows automated verification and reasoning.
Read the full abstract

All authors Jacques Carette, Chris Heunen, Robin Kaarsgaard, Neil J. Ross, Amr Sabry

Probability

Overdamped limits for Langevin dynamics with position-dependent coefficients via $L^2$-hypocoercivity

This note provides a simple derivation of the overdamped approximation for kinetic (or underdamped) equilibrium Langevin dynamics, in cases where certain coefficients depend on the position variable. The equivalent small-mass limit of these dynamics, known as the Kramers–Smoluchowski approximation, in the case of a state-dependent friction coefficient, has been previously studied by a variety of approaches. Our new approach uses hypocoercivity estimates, which may be of interest in their own right, and lead to a very direct derivation, providing in particular a clear explanation of the “noise-induced drift” term in the overdamped equation in the case of a state-dependent friction term. Using the same approach, we also treat effective kinetic dynamical models derived from a coarse-graining approximation of a high-dimensional system, as well as a class of kinetic dynamics with position-dependent mass matrices. All of these models are relevant to applications in computational chemistry. We finally identify a mistake in a related work, and suggest a solution.
Read the full abstract

Algebraic Geometry

Webs and smooth components of two column Springer fibers

Webs and Springer fibers are separately important objects in representation theory: webs give a diagrammatic calculus for tensor invariants of $\mathfrak{sl}_k$, and the cohomology group of Springer fibers can be used to construct the irreducible representations of the symmetric group. Fung's 1997 thesis gave the first evidence of a connection between $\mathfrak{sl}_2$ webs and Springer fibers, showing that webs naturally index and describe the components of certain "two row" Springer fibers. However, this case is known to be far from generic. This paper deepens this connection with a similar correspondence in the substantially more complicated "two column" case. In particular, and building on works of Fresse, Melnikov, and Sakas-Obeid, we use webs to give a clean characterization of the smooth components of two column rectangle Springer fibers and a simple description of the geometry of these smooth components. We also show that the Poincaré polynomial of the smooth components is invariant under the natural dihedral action on the corresponding webs.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

The empirical laws for Majorana fields in a curved spacetime

This article is a sequel to our previous paper (arXiv:2511.12311), where we considered the conceptual problem on the empirical laws for the Klein\textendash Gordon quantum field theory in curved spacetime (QFTCS), and we will consider the similar problems for the Majorana field on curved spacetime here. A “law” in theoretical physics is said to be observable or empirical only if it can be verified/falsified by some experimental procedure. The notion of empiricality/observability becomes far more unclear in QFTCS, than in QFT in Minkowski (flat) spacetime (QFTM), mainly because QFTCS lacks the notion of vacuum. This could potentially undermine the status of QFTCS as a physical (not only mathematical) theory. We consider this problem for the Majorana field in curved spacetime, and examine some examples of the empirical laws.
Read the full abstract

Analysis of PDEs

Inverse problems for quasi-linear elliptic systems modeling electrolysers

We investigate the electrochemical processes within an electrolyser cell, which are modelled by a coupled system of second-order quasi-linear elliptic PDEs. In this context, we study an inverse problem aiming to reconstruct both the non-linear diffusion coefficients and the phenomenological relation defining the electric potential. Our main results state that boundary measurements alone are not enough to reconstruct these non-linear quantities. However, we show that a combination of boundary and interior measurements allow for their unique reconstruction. To achieve this result we generalise a linearisation result in the context of the scalar quasi-linear Calderón problem, [Sun, Math. Z. 221 (1996)], to the setting of a system of PDEs with non-local nonlinearities. In contrast to the Calderón case, the generalised linearisation does not "freeze" the coefficients. We show that interior measurements are precisely what is required to achieve this freezing and thus enable the unique reconstruction.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Kerr-Schild solutions in Multigravity and the Classical Double Copy

We explore the multimetric theory of gravitation, also known as multigravity. We derive additional new exact solutions for the theory in proportional Kerr-Schild and double Kerr-Schild forms. We extend several solutions from the theory of General Relativity, characterized by a constant Ricci scalar in single and double Kerr-Schild forms, to derive solutions in the multi-gravity context. We also examine and extend the classical double copy relations that can be constructed out from these solutions in multigravity exploring the dynamics of the single copy and zero copy fields.
Read the full abstract

Algebraic Geometry

Translational surfaces and iterated resultants

A translational surface is a tensor product surface constructed from two space curves by translating one along the other. These surfaces are common within geometric modeling and, since their description is parametric, it is desirable to obtain the implicit equation of such a surface. These surfaces have been studied thoroughly by Goldman and Wang, where a particular set of syzygies was identified and shown to yield the implicit equation through an inhomogeneous resultant. As this method may fail in the presence of ill-behaved basepoints of the parameterization, we offer an alternative method in this article using iterated homogeneous resultants. The algorithm presented here involves smaller Sylvester matrices overall, potentially resulting in faster computation, and succeeds in many instances where the previous method cannot be applied.
Read the full abstract

Combinatorics

A complete solution to the directed Oberwolfach problem of order $2 \pmod{4}$ with cycles of even lengths

The Oberwolfach problem asks for a $2$-factorization of the complete graph in which each $2$-factor is isomorphic to a specific factor $F$. Recently, this problem has been extended to directed graphs. In this case, the directed Oberwolfach problem asks for a directed 2-factorization of the complete symmetric digraph in which each directed $2$-factor is isomorphic to a specific directed factor $F$. In this paper, we consider the directed Oberwolfach problem with directed 2-factors comprised of cycles of even lengths. Specifically, we provide a complete solution to this particular case when the order of the complete symmetric digraph is congruent to 2 modulo 4.
Read the full abstract

Group Theory

Characters and $II_1$-Factor Representations of Full Groups of Cantor Minimal Systems

Let $(X,T)$ be a Cantor minimal system, and let $\Gamma$ denote either its associated topological full group or the full group of a Bratteli diagram associated with $(X,T)$. In this paper we describe the structure of indecomposable (extreme) characters and the associated $\textrm{II}_1$-factor representations for the group $\Gamma$ and its commutator subgroup $\Gamma'$. In particular, we prove that: (1) for every nontrivial indecomposable character $\chi$ of $\Gamma'$, there exists a finite collection (with repetitions allowed) $\{\mu_i\}_{i\in I}$ of $T$-invariant ergodic measures on $X$ such that $\chi(\gamma) = \prod_{i\in I} \mu_i(Fix(\gamma))$, for every $\gamma \in \Gamma'$, where $Fix(\gamma) = \{x\in X : \gamma x = x\}$; and (2) each indecomposable character of $\Gamma$ is the product of an indecomposable character of the form $\prod_{i\in I} \mu_i(Fix(\gamma))$ and a homomorphism from $\Gamma$ into the unit circle. As a consequence, we show that any finite-type unitary representation of $\Gamma'$ that does not contain a regular subrepresentation is automatically continuous with respect to the uniform topology on $\Gamma'$. We also establish a general result on automatic continuity of finite-type unitary representations of infinite groups, which we use in our proofs.
Read the full abstract

Group Theory

On Finiteness of Homological Isoperimetric Functions on Top Dimensions

We address a question from \cite{BKV25} regarding the finiteness of the homological $R$-isoperimetric function. Let $R$ be a subfield of the complex numbers $\mathbb{C}$ with the absolute value norm. We prove that for any group $G$ that admits a finite $(n+1)$-dimensional model for $K(G,1)$, the homological $n$-isoperimetric function of $G$ over $R$ is either linear or takes infinite values. In particular, by results of Gersten and Mineyev, in the class of groups admitting a finite $2$-dimensional classifying space, the homological $1$-dimensional isoperimetric function over $R$ only captures hyperbolicity. This follows as a particular case of a more general result proved in this note.
Read the full abstract

Logic · Cross-listed from cs.LO

Uniform interpolation with constructive diamond

Uniform interpolation is a strong form of interpolation providing an interpretation of propositional quantifiers within a propositional logic. Pitts' seminal work establishes this property for intuitionistic propositional logic relying on a sequent calculus in which naïve backward proof-search terminates. This constructive approach has been adapted to a wide range of logics, including intuitionistic modal logics. Surprisingly, no intuitionistic modal logic with independent box and diamond has yet been shown to satisfy uniform interpolation. We fill in this gap by proving the uniform interpolation property for Constructive K (CK) and Wijesekera's K (WK). We build on Pitts' technique by exploiting existing terminating calculi for CK and WK, which we prove to eliminate cut, and formalise all our results in the proof assistant Rocq. Together, our results constitute the first positive uniform interpolation results for intuitionistic modal logics with diamond.
Read the full abstract

Rings and Algebras

A Generalization of the Ehresmann-Schein-Nambooripad Theorem to Two-Sided Ehresmann Semigroupoids

We introduce the notion of two-sided Ehresmann semigroupoids and show that they are in correspondence with a specific class of categories, which we call local biordered Ehresmann categories. This correspondence provides a unified generalization of the Ehresmann-Schein-Nambooripad Theorem for both inverse semigroupoids and Ehresmann semigroups. In particular, two-sided restriction semigroupoids form a distinguished subclass of two-sided Ehresmann semigroupoids, and for this case we describe the associated class of categories, extending earlier results for restriction semigroups.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.dis-nn

Spectral boundaries of deterministic matrices deformed by rotationally invariant random non-Hermitian ensembles

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic solutions. In this paper, we illustrate this phenomenon in the context of spectral boundaries (or spectral edges) for deformed random matrices. Specifically, we consider matrices of the form $\mathbf{A} + \mathbf{B}$, where $\mathbf{A}$ is a deterministic $N\times N$ matrix (not necessarily Hermitian) and $\mathbf{B}$ is a rotationally invariant random matrix. In the large-$N$ limit, we show that the complex eigenvalue distribution of $\mathbf{A} + \mathbf{B}$ satisfies remarkably simple boundary equations that depend on the $\mathcal{R}_1$ and $\mathcal{R}_2$ transforms of $\mathbf{B}$. We illustrate our results on several explicit random matrix ensembles and support them with numerical simulations.
Read the full abstract

Algebraic Geometry

Dimension bounds for relative character varieties on the projective line with three punctures $G=GL(r), O(r), Sp(r)$

We consider relative character varieties on $\mathbb{P}^1\backslash\{0,1,\infty\}$ with $G=GL(r), O(r)$, or $Sp(r)$. Using a diagrammatic method of Simpson's, we give an explicit linear upper bound $R(d)$ on the rank $r$ of an MC-minimal character variety of dimension $d>2$. An arbitrary character variety is isomorphic, via Katz's middle convolution, to one satisfying the bound. For the general linear and non-overlapping quadratic cases, the bounds we give are the sharpest possible using this method.
Read the full abstract

Numerical Analysis

Domain Decomposition for Mean Curvature Flow of Surface Polygonal Meshes

We examine the use of domain decomposition for potentially more efficient mean curvature flow of surface meshes, whose faces are arbitrary simple polygons. We first test traditional domain decomposition methods with and without overlap of deconstructed domains. And we present adapted Robin transmission conditions of optimized Schwarz method. We then analyze the resulting smoothing from the point of view of shape quality and texture deformation. By decomposing the initial mesh into two sub-meshes, we solve two smaller boundary value problems instead of one big problem, and we can process these two tasks almost entirely in parallel.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Position: A Dynamical Systems Perspective is Needed to Advance Time Series Modeling

Time series (TS) modeling has come a long way from early statistical, mainly linear, approaches to the current trend in TS foundation models. With a lot of hype and industrial demand in this field, it is not always clear how much progress there really is. To advance TS forecasting and analysis to the next level, here we argue that the field needs a dynamical systems (DS) perspective. TS of observations from natural or engineered systems almost always originate from some underlying DS, and arguably access to its governing equations would yield theoretically optimal forecasts. This is the promise of DS reconstruction (DSR), a class of ML/AI approaches that aim to infer surrogate models of the underlying DS from data. But models based on DS principles offer other profound advantages: Beyond short-term forecasts, they enable to predict the long-term statistics of an observed system, which in many practical scenarios may be the more relevant quantities. DS theory furthermore provides domain-independent theoretical insight into mechanisms underlying TS generation, and thereby will inform us, e.g., about upper bounds on performance of any TS model, generalization into unseen regimes as in tipping points, or potential control strategies. After reviewing some of the central concepts, methods, measures, and models in DS theory and DSR, we will discuss how insights from this field can advance TS modeling in crucial ways, enabling better forecasting with much lower computational and memory footprints. We conclude with a number of specific suggestions for translating insights from DSR into TS modeling.
Read the full abstract

All authors Daniel Durstewitz, Christoph Jürgen Hemmer, Florian Hess, Charlotte Ricarda Doll, Lukas Eisenmann

Optimization and Control

Action-Space Entropy Regularization in Bayesian Markowitz

We solve the entropy-regularized mean–variance portfolio problem under Bayesian drift uncertainty. We combine continuous-time Bayesian filtering with stochastic policy optimization; the main finding is negative: the two mechanisms are orthogonal. Posterior dynamics are policy-independent, so entropy regularization cannot accelerate learning about the unknown drift. The mean control is identical to the deterministic Bayesian Markowitz feedback, and entropy enters only through policy variance. On the technical side, the optimal policy is Gaussian, the value function is quadratic in wealth, and the leading belief-dependent coefficient closes in exponential form. The framework recovers both parent models as limiting cases.
Read the full abstract

Differential Geometry

Complete closed-form solutions to the problem of inextensional bending for surfaces of translation and origami tessellations

Plates generally admit six deformation modes: three of which are high in strain energy, stretch the plate's midsurface and are called membrane modes; and three are low-energy, bend the midsurface without stretching it and are called bending modes. For origami tessellations, and other corrugated compliant thin shells, the modes are mixed and it is no longer clear what modes, if any, are low in energy in the sense that they are inextensional. Here, it is shown, by direct construction of closed-form solutions, that when the midsurface is a surface of translation, there exists three infinitesimally inextensional deformation modes that correspond to (1) stretching, with an effective Poisson's effect; (2) bending, with an effective synclastic or anti-clastic effect; and to (3) twisting. The provided expressions are valid irrespective of surface regularity and, in particular, properly handle any creases be them straight or curved. The results provide a powerful benchmark for the validation of numerical methods and further insight into the elastic stiffness of thin corrugated compliant shells.
Read the full abstract

Combinatorics

On the Gap Structure of Generalized Stirling Numbers

Katugampola's 2015 study of generalized fractional differential operators produced triangular arrays of integer coefficients indexed by a fractional order r and by dimensions n and k, but no combinatorial interpretation has been established for any fractional order. We give the first such interpretation, with two main results: (i) a complete combinatorial interpretation for r = 1/2 and n = 1,2,3, and (ii) a rigorous proof that this interpretation cannot extend to n >= 4 within the same framework. For n = 1,2,3, we show that the coefficients for r = 1/2 count binary sequences satisfying two conditions: they contain at least one symbol B, and they have gap <= 1, where the gap is the distance between the first and last occurrence of B. Each sequence is assigned a type k by a parity-dependent rule involving the gap value, and exhaustive enumeration matches Katugampola's coefficients exactly. We then prove an obstruction theorem showing that the gap <= 1 condition forces any such model to produce at most two distinct types per row, whereas Katugampola's array requires at least three types for every n >= 4. Thus the gap <= 1 binary-sequence interpretation works if and only if n = 1,2,3. Our results turn a computational observation into a rigorous impossibility theorem and provide guidance for future attempts to obtain complete combinatorial interpretations of fractional-calculus coefficients.
Read the full abstract

Logic

More Derived Models in PFA

This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show that the $\Theta$ of the derived model at $\kappa$ is strictly less than $\kappa^+$ under various circumstances; in particular, this shows that the conclusion holds under $PFA$ if $\kappa$ is a limit of Woodin cardinals of cofinality $\omega$ and the derived model does not satisfy $LSA$. Assuming a form of mouse capturing, we show that the derived model satisfies $AD_{\mathbb{R}}$ under $PFA$ when $\kappa$ is a regular limit of Woodin cardinals. If $\kappa$ is an indestructibly $(\kappa,\kappa^+)$-weakly compact limit of Woodin cardinals, then the derived model outright satisfies $AD_{\mathbb{R}}$.
Read the full abstract