Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 20 February
A signed graph $(G,\sigma)$ consists of a graph $G$ and the signature $\sigma : E(G) \rightarrow \{+1,-1\}$. An incidence of $G$ is a pair $(v,e)$, where $v$ is one of the end vertices of an edge $e \in E(G)$. A proper $q$-edge coloring $\gamma$ of signed graph $(G,\sigma)$ is an assignment of colors to incidences satisfying that $\gamma(v,e) = - \sigma(e) \gamma(w,e)$ for every edge $e=vw$ and for any two incidences $(v,e)$ and $(v,f)$, involving the same vertex, $\gamma(v,e) \neq \gamma(v,f)$. The chromatic index of a signed graph $(G,\sigma)$, denoted by $\chi'(G,\sigma)$, is the minimum number $q$ for which $(G,\sigma)$ has a proper $q$-edge coloring. In this paper, we determine the chromatic index of signed generalized book graphs. We also determine the chromatic index of signed complete graphs of order up to six.
Combinatorics
Coloring Questions on Axis-Parallel Rectangles and Arithmetic Progressions
We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach, Szegedy, and Tardos. They showed that for any constants $c,k\ge1$, there exists a finite point set $P$ in the plane with the following property: for every coloring of $P$ with $c$ colors, there is an axis-parallel rectangle containing at least $k$ points, all of the same color. Their original proof is probabilistic; we present an explicit construction. Moreover, in the case $k=2$, we show that one can even realize a graph that has arbitrarily large girth and chromatic number simultaneously. We also answer a question of Pálvölgyi on coloring sets of integers with respect to certain finite arithmetic progressions. Finally, we give an application to coloring partially ordered sets.
Read the full abstract
Probability
Weak error approximation for rough and Gaussian mean-reverting stochastic volatility models
For a class of stochastic models with Gaussian and rough mean-reverting volatility that embeds the genuine rough Stein-Stein model, we study the weak approximation rate when using a Euler type scheme with integrated kernels. Our first result is a weak convergence rate for the discretised rough Ornstein-Uhlenbeck process, that is essentially in $\min(3\alpha-1,1)$, where $\frac{t^{\alpha-1}}{\Gamma(\alpha)} $ is the fractional convolution kernel with $\alpha \in (1/2,1)$. Then, our main result is to obtain the same convergence rate for the corresponding stochastic rough volatility model with polynomial test functions.
Read the full abstract
Numerical Analysis
A Parametric Finite Element Approach for an Anisotropic Multi-Phase Mullins-Sekerka Problem with Kinetic Undercooling
We consider a sharp interface formulation for an anisotropic multi-phase Mullins-Sekerka problem with kinetic undercooling. The flow is characterized by a cluster of surfaces evolving such that the total surface energy plus a weighted sum of the volumes of the enclosed phases decreases in time. Upon deriving a suitable variational formulation, we introduce a fully discrete unfitted finite element method. In this approach, the approximations of the moving interfaces are independent of the triangulations used for the equations in the bulk. Our method can be shown to be unconditionally stable. Several numerical examples demonstrate the capabilities of the introduced method. In particular, it is demonstrated that the evolution of multiple ice crystals with junctions can be modeled using the proposed approach.
Read the full abstract
Group Theory
Dyer groups have the falsification by fellow-traveller property
This paper is devoted to the study of the falsification by fellow-traveller property (FFTP) in Dyer groups. We exhibit a finite generating set for which the associated Cayley graph is a locally finite mediangle graph, and leverage its properties to prove that Dyer groups have the FFTP with respect to this generating set, from which it follows that Dyer groups have finitely many cone types. A key component of the proof is a generalisation of the Parallel Wall Theorem from Coxeter groups to Dyer groups. These results emphasise the role of Dyer groups in providing a unified approach to Coxeter groups and graph products of cyclic groups.
Read the full abstract
Analysis of PDEs
Periodic Delaunay cylinders with constant anisotropic nonlocal mean curvature
In this article we prove existence and symmetry properties of periodic surfaces of revolution with constant anisotropic nonlocal mean curvature, generalizing a classical result of Delaunay to the anisotropic nonlocal setting. First, by studying the corresponding periodic isoperimetric problem, under natural assumptions on the kernel, we use rearrangement inequalities to extend a periodic version of the Wulff inequality to the nonlocal setting. This leads to the existence and symmetry properties of minimizers for every given volume in each period, thus generalizing the results of Cabré, Csató, and Mas to the anisotropic case. Second, under the same hypotheses on the kernel, we prove the existence of a one-parameter family of Delaunay near-cylinders in $\mathbb{R}^2$ bifurcating from a straight cylinder and having each constant anisotropic mean curvature. This extends the results of Cabré, Fall, Solà-Morales, and Weth to the anisotropic case. The stability of these near-cylinders will be studied in a forthcoming paper.
Read the full abstract
Analysis of PDEs
On the shape of minimizers for the periodic nonlocal perimeter in $\mathbb{R}^2$
In this paper, we study planar nonlocal Delaunay sets. That is, open sets in $\mathbb{R}^2$ with constant nonlocal mean curvature that are periodic in $x_1$, and even in $x_1$ and in $x_2$. Using bifurcation analysis and fine explicit computations, we prove that every sufficiently $C^{1,\beta}$-flat nonlocal Delaunay set in $\mathbb{R}^2$ that is not a straight band is unstable with respect to volume-preserving periodic variations. Our results support the conjecture that, as in the local case, in the range of large areas, minimizers of the periodic nonlocal isoperimetric problem – also known as the nonlocal liquid drop problem with prescribed area between two parallel hyperplanes – are all straight bands.
Read the full abstract
Statistics Theory
Quantitative concentration inequalities for the uniform approximation of the IDS
The integrated density of states (IDS) is a fundamental spectral quantity for quantum Hamiltonians modeling condensed matter systems, describing how densely energy levels are distributed. It can be interpreted as a volume-averaged spectral distribution. Hence, there are two equivalent definitions of the IDS related by the Pastur-Shubin formula: an operator-theoretic trace formula and a limit of normalized eigenvalue counting functions on finite volumes. We study a discrete random Schrödinger operator with bounded random potentials of finite-range correlations and prove a quantitative concentration inequality ensuring, with explicit high probability, that the empirical IDS (normalized eigenvalue counting function) uniformly approximates the abstract IDS trace formula within a prescribed error, thereby implying confidence regions for the IDS.
Read the full abstract
Spectral Theory
On the directional growth of the resolvent norm
Let $A$ be a closed densely defined operator on a separable Hilbert space $\mathcal{H}$. Assume the resolvent set $\rho(A)$ is non-empty. For $z,z'\in\rho(A)$ let $[z,z']$ denote the straight line segment from $z$ to $z'$. For each $z\in\rho(A)$ we classify the behavior of the resolvent norm $\zeta\mapsto\lVert R_A(\zeta) \rVert$ near $z$. Either there are $z'\in\rho(A)$, $z'\neq z$, $[z,z']\subset\rho(A)$, such that $\lVert R_A(\zeta) \rVert \geq \lVert R_A(z) \rVert + C\lvert \zeta-z \rvert^\delta$ for $\zeta\in[z,z']$ with $\delta=1$ or $\delta=2$, or the function $\zeta\mapsto\lVert R_A(\zeta) \rVert$ has a global minimum at $\zeta=z$.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Semiparametric Uncertainty Quantification via Isotonized Posterior for Deconvolutions
We address the problem of uncertainty quantification for the deconvolution model \(Z = X + Y\), where \(X\) and \(Y\) are nonnegative random variables and the goal is to estimate the signal's distribution of \(X \sim F_0\) supported on~\([0,\infty)\), from observations where the noise distribution is known. Existing frequentist methods often produce confidence intervals for $F_0(x)$ that depend on unknown nuisance parameters, such as the density of \(X\) and its derivative, which are difficult to estimate in practice. This paper introduces a novel and computationally efficient nonparametric Bayesian approach, based on projecting the posterior, to overcome this limitation. Our method leverages the solution \(p\) to a specific Volterra integral equation as in \cite{74}, which relates the cumulative distribution function (CDF) of the signal, \(F_0\), to the distribution of the observables. We place a Dirichlet Process prior directly on the distribution of the observed data $Z$, yielding a simple, conjugate posterior. To ensure the resulting estimates for \(F_0\) are valid CDFs, we isotonize posterior draws taking the Greatest Convex Majorant of the primitive of the posterior draws and defining what we term the Isotonic Inverse Posterior. We show that this framework yields posterior credible sets for \(F_0\) that are not only computationally fast to generate but also possess asymptotically correct frequentist coverage after a straightforward recalibration technique for the so-called Bayes Chernoff distribution introduced in \cite{54}. Our approach thus does not require the estimation of nuisance parameters to deliver uncertainty quantification for the parameter of interest $F_0(x)$. The practical effectiveness and robustness of the method are demonstrated through a simulation study with various noise distributions for $Y$.
Read the full abstract
Mathematical Physics
Twisted symmetric exclusion processes and set-theoretical $R$-matrices
We investigate periodic integrable Markov models, constructed from set-theoretical solutions of the Yang-Baxter equation. We first focus on the simplest class of solutions, called Lyubashenko solutions. We show that the resulting models are equivalent to some twisted Symmetric Simple Exclusion Process (SSEP), which are usual periodic SSEP models where a twist is added on a bond of the ring. We also provide various possible interpretations for these Markov models. Then, we study the long time dynamics of the twisted SSEP, characterising its different stationary states and counting them. Allowing the twist to vary, we examine the possible transitions between the different stationary states. Finally, we extend our construction of Markov models to set-theoretical solutions that are more general than Lyubashenko solutions and show that such models are not equivalent to a twisted SSEP in general.
Read the full abstract
Dynamical Systems
An embedding version of Rubin's theorem
Rubin's theorem asserts that if $\Gamma\curvearrowright X$ and $\Delta\curvearrowright Y$ are Rubin actions, then any group isomorphism $\Gamma \cong \Delta$ induces an equivariant homeomorphism $Y\cong X$. We provide an embedding version of Rubin's theorem highlighting group embeddings that induce a spatial equivariant map of a certain form. We further showcase instances of such embeddings between generalized Brin-Thompson groups.
Read the full abstract
Statistics Theory
Kolmogorov-Type Maximal Inequalities for Independent and Dependent Negative Binomial Random Variables: Sharp Bounds, Sub-Exponential Refinements, and Applications to Overdispersed Count Data
This paper develops Kolmogorov-type maximal inequalities for sums of Negative Binomial random variables under both independence and dependence structures. For independent heterogeneous Negative Binomial variables we derive sharp Markov-type deviation inequalities and Kolmogorov-type bounds expressed in terms of Tweedie dispersion parameters, providing explicit control limits for NB2 generalized linear model monitoring. For dependent count data arising through a shared Gamma mixing variable, we establish a sub-exponential Bernstein-type refinement that exploits the Poisson-Gamma hierarchical structure to yield exponentially decaying tail probabilities – this refinement is new in the literature. Through moment-matched Monte Carlo experiments ($n=20$, 2{,}000 replications), we document a 55% reduction in mean maximum deviation under appropriate dependence structures, a stabilization effect we explain analytically. A concrete epidemiological application with NB2 parameters calibrated from COVID-19 surveillance data demonstrates practical utility. These results materially advance the applicability of classical maximal inequalities to overdispersed and dependent count data prevalent in public health, insurance, and ecological modeling.
Read the full abstract
Analysis of PDEs
Nonlocal-to-local $L^p$-convergence of convolution operators with singular, anisotropic kernels
We study nonlocal convolution-type operators with singular, possibly anisotropic kernels. Our main objective is to establish and quantify their nonlocal-to-local convergence to a local differential operator with natural boundary conditions, as the kernels concentrate at the origin in a suitable way. Such convergence results provide a useful tool for the physical justification of mathematical models, particularly in situations where the desired local differential operator cannot be directly derived from microscopic laws. The present work substantially extends previous results by allowing kernels with stronger singularities (comparable to those of fractional Laplacians), anisotropic and non-localized kernels, and by proving strong convergence in general $L^p$ spaces together with explicit convergence rates.
Read the full abstract
Metric Geometry
One-dimensional and codimension one homology of metric manifolds
We compare singular homology and homology via integral currents in metric spaces that are homeomorphic to smooth manifolds. For such spaces, we provide sufficient conditions that guarantee the existence of a surjective homomorphism from the codimension one homology group via integral currents to the codimension one singular homology group. Moreover, we show that a one-dimensional isoperimetric inequality for integral currents implies that the one-dimensional homology groups coincide.
Read the full abstract
Probability
Strong law of large numbers for $\varphi$-sub-Gaussian random variables under sub-linear expectation spaces
We introduce the notions of sub Gaussian random variables in sub-linear expectation spaces. To avoid the problem caused by the existence of two different expectations, i.e., the upper expectation and the lower expectation, we divide the definition of the sub-Gaussian property into an upper part and a lower part. It turns out that this approach fits well to the sub-linear setting; it provides a proper framework for extending Zajkowski's general result to sublinear expectation spaces. Within our framework, we establish a strong law of large numbers for sub-Gaussian sequences. We present an example showing the usefulness of our results.
Read the full abstract
Information Theory
Uncertainty-Aware Jamming Mitigation with Active RIS: A Robust Stackelberg Game Approach
Malicious jamming presents a pervasive threat to the secure communications, where the challenge becomes increasingly severe due to the growing capability of the jammer allowing the adaptation to legitimate transmissions. This paper investigates the jamming mitigation by leveraging an active reconfigurable intelligent surface (ARIS), where the channel uncertainties are particularly addressed for robust anti-jamming design. Towards this issue, we adopt the Stackelberg game formulation to model the strategic interaction between the legitimate side and the adversary, acting as the leader and follower, respectively. We prove the existence of the game equilibrium and adopt the backward induction method for equilibrium analysis. We first derive the optimal jamming policy as the follower's best response, which is then incorporated into the legitimate-side optimization for robust anti-jamming design. We address the uncertainty issue and reformulate the legitimate-side problem by exploiting the error bounds to combat the worst-case jamming attacks. The problem is decomposed within a block successive upper bound minimization (BSUM) framework to tackle the power allocation, transceiving beamforming, and active reflection, respectively, which are iterated towards the robust jamming mitigation scheme. Simulation results are provided to demonstrate the effectiveness of the proposed scheme in protecting the legitimate transmissions under uncertainties, and the superior performance in terms of jamming mitigation as compared with the baselines.
Read the full abstract
Classical Analysis and ODEs
Sharp estimates for the Fourier transform of surface-carried measures and maximal operators associated with hypersurfaces in $\mathbb{R}^4$ with vanishing Gaussian curvature
In this paper, we study problems related to harmonic analysis on hypersurfaces in $\mathbb{R}^4 $ with zero Gaussian curvature and given as graphs of polynomial functions. We derive sharp uniform estimates with respect to the direction of frequencies for the Fourier transform of measures supported on such hypersurfaces. Additionally, we study the $L^p$-boundedness problem of maximal operators associated with hypersurfaces. We determine the exact value of the boundedness exponent in terms of the heights of these hypersurfaces.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Unifying Formal Explanations: A Complexity-Theoretic Perspective
Previous work has explored the computational complexity of deriving two fundamental types of explanations for ML model predictions: (1) *sufficient reasons*, which are subsets of input features that, when fixed, determine a prediction, and (2) *contrastive reasons*, which are subsets of input features that, when modified, alter a prediction. Prior studies have examined these explanations in different contexts, such as non-probabilistic versus probabilistic frameworks and local versus global settings. In this study, we introduce a unified framework for analyzing these explanations, demonstrating that they can all be characterized through the minimization of a unified probabilistic value function. We then prove that the complexity of these computations is influenced by three key properties of the value function: (1) *monotonicity*, (2) *submodularity*, and (3) *supermodularity* - which are three fundamental properties in *combinatorial optimization*. Our findings uncover some counterintuitive results regarding the nature of these properties within the explanation settings examined. For instance, although the *local* value functions do not exhibit monotonicity or submodularity/supermodularity whatsoever, we demonstrate that the *global* value functions do possess these properties. This distinction enables us to prove a series of novel polynomial-time results for computing various explanations with provable guarantees in the global explainability setting, across a range of ML models that span the interpretability spectrum, such as neural networks, decision trees, and tree ensembles. In contrast, we show that even highly simplified versions of these explanations become NP-hard to compute in the corresponding local explainability setting.
Read the full abstract
Numerical Analysis
Theoretical insights on the residual transformation from bi-conjugate gradient into bi-conjugate residual via a smoothing scheme
Bi-conjugate gradient (Bi-CG) and bi-conjugate residual (Bi-CR) methods are underlying iterative solvers for linear systems with nonsymmetric matrices. Residual smoothing is a standard technique for obtaining smooth convergence behavior of residual norms; additionally, it represents the transformation between iterative methods. For example, the residuals of the CR method can be obtained by applying a smoothing scheme to those of the CG method for symmetric linear systems. Based on this relationship, the transformation from Bi-CG residuals to Bi-CR residuals using a smoothing scheme was examined in our previous study [Kawase, A., Aihara, K.: Transformation from Bi-CG into Bi-CR Using a Residual Smoothing-like Scheme. AIP Conference Proceedings (2026)]; however, we only provided heuristic and experimental observations. In the present study, we provide a detailed discussion on the theoretical aspects of these transformations. Specifically, we prove that the resulting algorithm transformed from the Bi-CG method using the residual smoothing technique has the same bi-orthogonal properties as those of the original Bi-CR method. We also present a more concise transformation algorithm and its numerical example. These analyses complement our previous study and provide theoretical validity of the residual transformation between the Bi-CG and Bi-CR methods.
Read the full abstract
Optimization and Control · Cross-listed from q-fin.PM
Time consistent portfolio strategies for a general utility function
We study the Merton portfolio management problem within a complete market, non constant time discount rate and general utility framework. The non constant discount rate introduces time inconsistency which can be solved by introducing sub game perfect strategies. Under some asymptotic assumptions on the utility function, we show that the subgame perfect strategy is the same as the optimal strategy, provided the discount rate is replaced by the utility weighted discount rate $\rho(t,x)$ that depends on the time $t$ and wealth level $x$. A fixed point iteration is used to find $\rho$. The consumption to wealth ratio and the investment to wealth ratio are given in feedback form as functions of the value function.
Read the full abstract
Analysis of PDEs
Stability of the Shape for Circular Vortex Filaments under Non-Symmetric Perturbations
We establish the nonlinear orbital stability of circular vortex filaments governed by the Localized Induction Equation (LIE) under non-symmetric perturbations, within the framework of [Tani-Nishiyama, 1997]. This result extends the first author's recent work [Aiki, 2025] by removing symmetry assumptions on perturbations. While the circular filaments are known to be Lyapunov unstable due to linear growth of the translational mode, we prove that their shape remains globally stable modulo spatial translations and rotations about the symmetry axis. The crucial ingredient is a geometric stability estimate derived from the conservation of vector fluid impulse, which constrains the low-frequency modulations that are not covered by the relative energy. Finally, we relate the fluid impulse to an isoperimetric inequality, yielding a geometric constraint for closed filaments.
Read the full abstract
Information Theory · Cross-listed from cs.NI
Rethinking Beam Management: Generalization Limits Under Hardware Heterogeneity
Hardware heterogeneity across diverse user devices poses new challenges for beam-based communication in 5G and beyond. This heterogeneity limits the applicability of machine learning (ML)-based algorithms. This article highlights the critical need to treat hardware heterogeneity as a first-class design concern in ML-aided beam management. We analyze key failure modes in the presence of heterogeneity and present case studies demonstrating their performance impact. Finally, we discuss potential strategies to improve generalization in beam management.
Read the full abstract
Analysis of PDEs
On the weighted logarithmic potential operator
For a bounded open set $\Omega \subset \mathbb{R}^N$ with $N\geq 2$, and for positive continuous functions $w,g$ on $\overline{\Omega}$, we consider the weighted eigenvalue problem \begin{equation*} \mathcal{L}_{w} u =\tau gu, \end{equation*} where $\mathcal{L}_{w}$ is the weighted logarithmic potential operator on $L^2(\Omega)$ as defined below: \begin{equation*} \mathcal{L}_{w} u(x)=\int_\Omega \log\left(\frac{w(x)w(y)}{|x-y|}\right)u(y)dy. \end{equation*} We study the monotonicity and continuity of the largest positive eigenvalue $\tau_{w,g}^+(\Omega)$ with respect to $\Omega$, $w$, and $g$. We also establish that $\tau_{w,g}^+(\Omega)$ satisfies a reverse Faber Krahn inequality under polarization. We provide a sufficient condition for the existence of a negative eigenvalue in terms of the weighted transfinite diameter of $\Omega$, under the assumption that $\log w$ is superharmonic. For $\Omega\subset \mathbb{R}^2$, if $\Delta\log w $ is a constant $C$, we show that 0 can be an eigenvalue of $\mathcal{L}_{w}$ only when $C=\frac{2\pi}{|\Omega|}$. For such domains, if $\log w$ is a harmonic function on $\Omega$, we provide a representation formula for the eigenfunctions. Using this representation, we establish variants of the maximum principles that give some insight into the geometry of these eigenfunctions.
Read the full abstract
Numerical Analysis
Computing accurate singular values using a mixed-precision one-sided Jacobi algorithm
We present a relative forward error analysis of a mixed-precision preconditioned one-sided Jacobi algorithm, analogous to a two-sided version introduced in [N. J. Higham, F. Tisseur, M. Webb and Z. Zhou, SIAM J. Matrix Anal. Appl. 46 (2025), pp. 2423-2448], which uses low precision to compute the preconditioner, applies it in high precision, and computes the singular value decomposition using the one-sided Jacobi algorithm at working precision. Our analysis yields relative forward error bounds involving the scaled condition number of the preconditioned matrix rather than that of the input matrix, potentially improving accuracy when the former is smaller. We present and analyze two approaches for constructing effective preconditioners. Our numerical experiments demonstrate that our algorithm achieves smaller relative forward errors than the LAPACK routines $\texttt{DGESVJ}$ and $\texttt{DGEJSV}$, as well as the MATLAB function $\texttt{svd}$, particularly for ill-conditioned matrices. Timing tests show that our approach accelerates the convergence of the Jacobi iterations and that the dominant cost arises from a single high-precision matrix-matrix multiplication. With improved software or hardware support for this bottleneck, our algorithm would be faster than the LAPACK one-sided Jacobi algorithm $\texttt{DGESVJ}$ and comparable in speed to the state-of-the-art preconditioned one-sided Jacobi algorithm $\texttt{DGEJSV}$, but much more accurate.
Read the full abstract
Numerical Analysis · Cross-listed from cs.CE
Comparative study of different quadrature methods for cut elements
The quadrature of cut elements is crucial for all Finite Element Methods that do not apply boundary-fitted meshes. It should be efficient, accurate, and robust. Various approaches balancing these requirements have been published, with some available as open-source implementations. This work reviews these open-sources codes and the methods used. Furthermore, benchmarking examples are developed for 2D and 3D geometries. Implicit and explicit boundary descriptions are available for all models. The different examples test the efficiency, accuracy, versatility, and robustness of the codes. Special focus is set on the influence of the input parameter, which controls the desired quadrature order, on the actual integration error. A detailed comparison of the discussed codes is carried out. The benchmarking allows a conclusive comparison and presents a valuable tool for future code development. All tests are published in an accompanying open-source repository.
Read the full abstract
Geometric Topology
Stuck Knots: Rigidity, Invariants, and Unsticking Distance
A stuck knot is a knot diagram containing designated crossings, called stuck crossings, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and introduce new geometric features into the study of knot embeddings. In this paper we develop a topological framework for knots governed by such constraints. We model stuck crossings as locally rigid configurations in spatial embeddings, placing stuck knots in close relation to rigid spatial graph theory while preserving the classical over-under information and orientation of crossings. We formalize the corresponding notion of isotopy and introduce the unstick move, which releases rigidity and allows classical simplifications to occur. To detect rigid structure algebraically, we construct polynomial invariants for stuck knots, including a HOMFLYPT-type invariant and a state-sum model extending the Kauffman bracket. These invariants show that rigidity contributes independent information even when the underlying classical knot type remains fixed. We further introduce a relaxed isotopy framework and define the unsticking distance, a geometric measure quantifying the minimal number of rigidity constraints that must be released in order to relate two stuck knots. This perspective interprets stuck crossings as barriers to isotopy and highlights the role of constraint release in diagrammatic simplification.
Read the full abstract
Number Theory
A new class of Correlations insisting on Ramanujan expansions
Studying Correlations with Ramanujan Expansions, we arrive to present the new class of, say, Two-Seasons Correlations, abbr. T-S, as a natural set expressing some of the features of, say, H-L-like Correlations; these are the ones that mimic the H-L ($=$Hardy-Littlewood) Correlation with shift $2k$, needed to study $2k-$twin primes following Hardy & Littlewood Conjecture. After introducing the $3-$Hypotheses Correlations in a previous paper, we add two other, very natural, hypotheses: the fifth is a technical one, simplifying calculations; but the fourth is called 'Parity', since it deals with the parity of natural numbers we play with. In particular, we may build (devoting to this 'our mainstream', here) a single Correlation that satisfies these '5 Axioms', thus a T-S one, that 'entangles two different Correlations' (whence Two-Seasons: T-S) depending on $a$ ($=$ the shift) parity. For $a$ even, our 'Artifact' mimics the H-L Correlation, in fact $a=2k$; but, while H-L Correlation is 'negligible', say, on $a$ odd, our Artifact seems to compare at least in the order of magnitude to H-L Correlation on $a$ even, being linked to another additive problem. Namely, on $a$ even, the Artifact 'counts', say, classic solutions to: $p_1+a=p_2$, in odd primes $p_1,p_2$; while, on $a$ odd, it 'counts' solutions to: $p_1+a=2^j p_2$, again with odd primes $p_1,p_2$ and with $j\in \N$ (satisfying the natural arithmetic constraints). More in general, our T-S Correlations 'entangle' two different Diophantine equations.
Read the full abstract
Mathematical Physics
The cross states of a composite quantum system: separability and entanglement in any Hilbert space dimension
We introduce a class of states of a composite quantum system, the so-called cross states, that turn out to play a major role in the theory of entanglement for a genuinely infinite-dimensional bipartite system. In the case where at least one of the Hilbert spaces of the bipartition is finite-dimensional, all states are cross states, whereas, in the genuinely infinite-dimensional setting where the dimension of both Hilbert spaces is not finite, the cross states form a trace-norm dense, convex, proper subset of the set of all states. In the latter case, the cross states can be regarded as those physical states that possess a finite amount of entanglement; accordingly, all separable states are of this kind. We prove that, for any Hilbert space dimension, the separable states can be characterized as those cross states that minimize a suitable norm, i.e., the projective norm associated with the projective tensor product of two trace classes; all other cross states are density operators belonging to the projective tensor product space. This is a generalization of the classical cross norm criterion of separability. Finally, we define an extended real-valued entanglement function and study its main properties. Coherently with the interpretation of cross states as finitely entangled states, this function is finite, and coincides with the projective norm, precisely on the cross states of the system.
Read the full abstract
Combinatorics
On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every $n$-vertex $2$-outerplane graph has a set of at least $2n/3$ vertices that induces an outerplane graph. We identify a major flaw in their proof and recover their result with a different, and unfortunately much more complex, proof.