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)

Thursday 26 February

Information Theory · Cross-listed from stat.ML

Kernel Integrated $R^2$: A Measure of Dependence

We introduce kernel integrated $R^2$, a new measure of statistical dependence that combines the local normalization principle of the recently introduced integrated $R^2$ with the flexibility of reproducing kernel Hilbert spaces (RKHSs). The proposed measure extends integrated $R^2$ from scalar responses to responses taking values on general spaces equipped with a characteristic kernel, allowing to measure dependence of multivariate, functional, and structured data, while remaining sensitive to tail behaviour and oscillatory dependence structures. We establish that (i) this new measure takes values in $[0,1]$, (ii) equals zero if and only if independence holds, and (iii) equals one if and only if the response is almost surely a measurable function of the covariates. Two estimators are proposed: a graph-based method using $K$-nearest neighbours and an RKHS-based method built on conditional mean embeddings. We prove consistency and derive convergence rates for the graph-based estimator, showing its adaptation to intrinsic dimensionality. Numerical experiments on simulated data and a real data experiment in the context of dependency testing for media annotations demonstrate competitive power against state-of-the-art dependence measures, particularly in settings involving non-linear and structured relationships.
Read the full abstract

All authors Pouya Roudaki, Shakeel Gavioli-Akilagun, Florian Kalinke, Mona Azadkia, Zoltán Szabó

Mathematical Physics · Cross-listed from hep-th

Holomorphic Quantization in Constant Curvature Backgrounds

We present a holomorphic quantization scheme for free point particles on two-dimensional constant curvature Riemannian backgrounds. The procedure is based on a Lagrangian embedding of the particle configuration space into a product of coadjoint orbits of the background isometry group. Examples are provided by particles on the plane, torus, sphere, and hyperbolic plane, with or without a monopole field. We elaborate the method by recovering the Hamiltonian spectrum and the wave functions on such spaces. As a by-product, we obtain a geometric and physical interpretation of Repka's result on the decomposition of tensor products of $\mathbf{SL}(2,\mathbb{R})$ discrete series representations.
Read the full abstract

Combinatorics

Isolation critical graphs under multiple edge subdivision

This paper introduces the notion of an $(\iota,q)$-critical graph. The isolation number of a graph $G$, denoted by $\iota(G)$ and also known as the vertex-edge domination number of $G$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the subgraph induced by the set of vertices that are not in the closed neighbourhood of $D$ has no edges. A graph $G$ is $(\iota,q)$-critical if every subdivision of $q$ edges of $G$ gives a graph whose isolation number is greater than $\iota(G)$, and $G$ has $q-1$ edges such that subdividing them gives a graph whose isolation number is $\iota(G)$. We show that an $(\iota,q)$-critical graph exists for every integer $q \ge 1$. We prove that if $G$ is a connected $m$-edge non-star graph, then $G$ is $(\iota,q)$-critical for some $q \le m - 1$. We show that this bound is best possible. We provide a general characterization of $(\iota,1)$-critical graphs as well as a constructive characterization of $(\iota,1)$-critical trees, demonstrating that $(\iota,1)$-criticality can be checked in linear time for trees.
Read the full abstract

All authors Karl Bartolo, Peter Borg, Magda Dettlaff, Magdalena Lemańska, Paweł Żyliński

Differential Geometry · Cross-listed from cond-mat.soft

Coupling between Phase Separation and Geometry on a Closed Elastic Curve: Free Energy Minimization and Dynamics

We study the free energy and dynamics of a closed elastic filament (a one-dimensional curve in two dimensions) coupled to a scalar concentration field representing, for example, an absorbed species. The density variable has a tendency to phase-separate whereas the local spontaneous curvature is concentration-dependent. We address analytically and by simulation both the free energy landscape and the dynamics (the latter comprising a coupled Willmore flow and Cahn–Hilliard gradient flow on the full differential geometry of a closed filament), addressing issues that previous work typically sidestepped by restricting to the Monge gauge. Specifically we find that the closure constraint for a deformable filament qualitatively changes the free energy landscape compared with either a rigid closed filament or an open elastic one, admitting metastable and stable states with more than one domain of each type. By numerical global free energy minimization we explore equilibrium morphologies across a wide range of model parameters. For selected parameter values we present fully dynamical results, tracking the time evolution of the various contributions to the free energy and confirming the emergence of both metastable and equilibrium multi-domain morphologies.
Read the full abstract

Logic

Mekler's Construction and the Preservation of NCTP and NBTP

We give criteria for a first-order theory to be NCTP or NBTP using tree-indiscernibility. As an application, we show that Mekler's construction preserves NCTP and NBTP.

Differential Geometry

A strict gap above the Brito–Chacon–Naveira bound for the Sasaki volume on higher odd spheres

For a smooth unit vector field $V$ on the round sphere $S^{2m+1}$, its Sasaki volume is the volume of its graph in the unit tangent bundle. Brito, Chacón and Naveira proved that this volume is at least $c_m\operatorname{vol}(S^{2m+1})$, where $c_m=4^m/\binom{2m}{m}$. We prove that, for every $m\ge2$, the infimum over smooth unit fields is strictly larger than this value. The proof constructs a global closed comass-one form on $T^1S^{2m+1}$ and classifies all of its equality planes. A hypothetical sequence approaching the bound has a calibrated integral-current limit. Its positive horizontal-Jacobian part is a multiplicity-one graph, whereas its projection-degenerate residual is confined to a base-rank-one equality plane. Coordinate test forms show that this residual contributes no singular part to the distributional derivative of the graph section. The section is therefore Sobolev and satisfies a scalar concircular equation; a weak rigidity theorem identifies it with a radial distance-gradient field. The radial graph has the two pole fibers as boundary, while a local boundary–mass identity forces the residual to vanish, contradicting the cycle condition. We also prove a sharp current-level flat-boundary inequality for fillings of the pole fibers. Consequently, every sequence of smooth unit fields converging in measure to a radial field has lower limiting volume at least twice the Brito–Chacón–Naveira bound. The strict gap obtained here is qualitative; no explicit gap constant is claimed.
Read the full abstract

Information Theory

Frequency-Ordered Tokenization for Better Text Compression

We present frequency-ordered tokenization (FOT), a simple preprocessing technique that improves lossless text compression by exploiting the power-law frequency distribution of natural language (Zipf's law). FOT segments text into the vocabulary of a pretrained Byte Pair Encoding (BPE) tokenizer, renumbers tokens by frequency with a fixed table, and writes them with a short byte code before any standard compressor. Because the FOT stream is less than half the size of the text, compressors produce smaller output and run faster at the same time. On enwik8 (100 MB of Wikipedia), FOT reduces the compressed size by 7.96 percentage points (pp) for zlib, 2.24 pp for xz (LZMA), 1.96 pp for brotli and 1.44 pp for zstd, while making total compression, including the transform, 1.6x, 3.2x, 1.8x and 5.0x faster. Gains hold from 100 KB to 1 GB (enwik9) and across texts of diverse languages, and outperform the classical Word Replacing Transform. On enwik9, FOT with tuned xz sets a new state of the art among LZ-based compressors on the Large Text Compression Benchmark. The method can be implemented in under 50 lines of code.
Read the full abstract

Statistics Theory

Effective sample size approximations as entropy measures

In this work, we analyze alternative effective sample size (ESS) metrics for importance sampling algorithms, and discuss a possible extended range of applications. We show the relationship between the ESS expressions used in the literature and two entropy families, the Rényi and Tsallis entropy. The Rényi entropy is connected to the Huggins-Roy's ESS family introduced in \cite{Huggins15}. We prove that that all the ESS functions included in the Huggins-Roy's family fulfill all the desirable theoretical conditions. We analyzed and remark the connections with several other fields, such as the Hill numbers introduced in ecology, the Gini inequality coefficient employed in economics, and the Gini impurity index used mainly in machine learning, to name a few. Finally, by numerical simulations, we study the performance of different ESS expressions contained in the previous ESS families in terms of approximation of the theoretical ESS definition, and show the application of ESS formulas in a variable selection problem.
Read the full abstract

Algebraic Geometry

On a conjecture of Fujino and Sato

We revisit results of Fujino–Sato on complete non-projective $\mathbb Q$-factorial toric varieties and their conjectural factorization by flips. We show that their main results admit short conceptual proofs, avoiding any restriction on the dimension and the Picard number, from the general theory of Cox rings and Mori Dream Spaces, once one organizes small $\mathbb Q$-factorial modifications via the GKZ (secondary fan) decomposition of the moving cone. Moreover, we extend this viewpoint beyond the toric case by proving an analogous statement for complete $\mathbb Q$-factorial weak Mori Dream Spaces: any non-projective such variety admits a divisor $D$ and a $D$-flip to a (projective) Mori Dream Space. Our approach highlights the role of chambers and wall-crossing in the secondary fan as a unifying framework for these constructions.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Steady State Covariance Steering via Sparse Intervention

This paper addresses the steady state covariance steering for linear dynamical systems via structural intervention on the system matrix. We formulate the covariance steering problem as the minimization of the Kullback-Leibler (KL) divergence between the steady state and target Gaussian distributions. To solve the problem, we develop a solution method, hereafter referred to as the proximal gradient-based algorithm, of promoting sparsity in the structural intervention by integrating the objective into a proximal gradient framework with L1 regularization. The main contribution of this paper lies in the analytical expression of the KL divergence gradient with respect to the intervention matrix: the gradient is characterized by the solutions to two Lyapunov equations related to the state covariance equation and its adjoint. Numerical simulations demonstrate that the proximal gradient-based algorithm effectively identifies sparse, structurally-constrained interventions to achieve precise covariance steering.
Read the full abstract

Information Theory

Semantic Communication Through the Lens of Context-Dependent Channel Modeling

Semantic communication has emerged as a promising paradigm for next-generation networks, yet several fundamental challenges remain unresolved. Building on the probabilistic model of semantic communication and leveraging the concept of context, this paper examines a specific subclass of semantic communication problems, where semantic noise originates solely from the semantic channel, assuming an ideal physical channel. To model this system, we introduce a virtual state-dependent channel, where the state-representing context-plays a crucial role in shaping communication. We further analyze the representational capability of the semantic encoder and explore various semantic communication scenarios in the presence of semantic noise, deriving capacity results for some cases and achievable rates for others.
Read the full abstract

Analysis of PDEs

Blow-Up Theory and Liouville-Type Theorem for Solutions of a Class of Generalized Camassa-Holm-Kadomtsev-Petviashvili Equations

We investigate the blow-up behavior and Liouville-type theorems of solutions to a class of generalized Camassa-Holm-Kadomtsev-Petviashvili (CH-KP) equations with a generally smooth nonlinear term $g(u)$. First, using the continuation method, we establish a blow-up criterion that is independent of the regularity index of initial data. Under the assumption that $ g'(u)$ is uniformly bounded, we prove the blow-up theorem and a weighted blow-up result by means of characteristic lines, a priori estimates and the Riccati inequality. Moreover, we extend these blow-up results to the setting where $g'(u)$ is polynomially controlled, which includes typical nonlinearities such as $ g(u)=\kappa u+3u^2 $ for the classical CH-KP equations. Furthermore, a Liouville-type uniqueness theorem is established under the condition $g(u) \geq \gamma u^2$ with $u \neq 0$, $g(u)>\gamma u^2$.
Read the full abstract

Statistics Theory

Remarks on stationary GARCH processes under heavy tail distributions

Let $(X_n)_{n\in \mathbb Z}$ be a GARCH process with $E(X_0^4)<\infty$, and let $\mu_n$ denote the distribution of $\frac 1{{\sqrt n}}\sum_{i=1}^n [X_i^2-\mathbb E(X_0^2)]$. We derive a numerical approximation of $\mu_n$ when $x_1,...,x_n$ are observed. This yields the derivation of confidence intervals for $\mu= E(X_0^2)$ and we investigate the accuracy of these confidence intervals in comparison with standard ones based on normal approximation. Moreover, when the innovation process has heavy tail distribution, we improve the method using a new resampling method.
Read the full abstract

Analysis of PDEs

Refined wave breaking for the generalized Fornberg-Whitham equation

This paper considers a class of non-local equations that are weakly dispersive perturbations of the inviscid Burgers equation, which includes the Fornberg-Whitham equation as a special case. We precise the known results on finite time blow-up (shock formation) by constructing a blowup solution which displays a `shock-like' singularity (called wave breaking) at one single point. Moreover, this solution converges asymptotically in the self-similar variables to a stable self-similar solution of the inviscid Burgers equation, and also possesses a Hölder $C^{1/3}$ regularity at the blowup point.
Read the full abstract

Combinatorics

On ubiquity problems in infinite digraphs

We prove that the consistently oriented double ray is ubiquitous if and only if it is ubiquitous restricted to the class of one-ended digraphs. Additionally, we prove the same equivalence for the disjoint union of a consistently forward and a consistently backward oriented ray. Furthermore, we discuss the connection between these two ubiquity problems.
Read the full abstract

Analysis of PDEs

Optimal sets for a geometric oscillation energy

We investigate the nonlocal energy corresponding to the $p$-oscillation of the unit normal vector for hypersurfaces, or the unit tangent vector for curves. The energy satisfies geometric inequalities with optimal constants $c(n,p)$ and $C(n,p)$ which are determined by a variational problem over the probability measures on the sphere. The extremal measures for such problem depend critically on the value of $p$. We prove existence of optimal sets for this energy under perimeter and volume constraint, and characterize their shape.
Read the full abstract

Number Theory

On rational quadratic cocycles

Let $(V,q)$ be a non-degenerate $n$-dimensional quadratic space over the rationals of real signature $(r,s)$. For every integer $1\leq k \leq \min\{r,n-2\}$ we construct classes in the cohomology of arithmetic subgroups of $\mathrm{O}(V)$ with values in the group of codimension $k$ cycles on the quadric of isotropic lines in $V$. Generating series of images of these classes in an equivariant version of the $k$-th Chow group are shown to be Siegel modular forms of genus $k$ in the extremal cases $k=1$ and $k=r$. Soit $(V,q)$ un espace quadratique non dégénéré de dimension $n$ sur les rationnels, de signature réelle $(r,s)$. Pour tout entier $1 \leq k \leq \min\{r,n-2\}$, nous construisons des classes dans la cohomologie des sous-groupes arithmétiques de $\mathrm{O}(V)$ à valeurs dans le groupe des cycles de codimension $k$ sur la quadrique des droites isotropes dans $V$. Les séries génératrices des images de ces classes dans une version équivariante du $k$-ième groupe de Chow sont des formes modulaires de Siegel de genre $k$ dans les cas extrémaux $k=1$ et $k=r$.
Read the full abstract

Analysis of PDEs

Orbital stability of monostable waves for reaction-diffusion systems

We study stability of monostable waves for reaction-diffusion systems. When the solution is initially close to a fast wave profile in optimal topology, we prove convergence to a shifted profile. The proof relies on explicit resolvent kernels estimates, allowing to handle weakly localized perturbations. It allows phase shift construction even when the translational eigenvalue is not associated to a zero of the Evans function. We further discuss distinction between Evans and Fourier eigenmodes when the marginal group velocity are directed towards the wave interface.
Read the full abstract

Category Theory

A note on varieties of ordered algebras

The aim of this work is to study the notions of lax protomodular and $\mathsf{Ord}$-Mal'tsev category at the level of (coherent) varieties of (pre)ordered algebras and to further compare them, as has been done in the non-ordered context. We characterise varieties of ordered algebras which are (co)lax protomodular and those which are $\mathsf{Ord}$-Mal'tsev, in terms of operations of arities given by ordered sets and inequalities involving them. We exhibit examples of (co)lax protomodular non-degenerate Ord-categories, which were unknown. We prove that, for varieties of ordered algebras which are $\mathsf{Ord}$-Mal'tsev categories, the order of their algebras is degenerate (i.e. is symmetric). As a consequence, the implication "protomodular => Mal'tsev" cannot be carried out to our context. The case of non-coherent ordered varieties which are $\mathsf{Ord}$-Mal'tsev categories is also addressed, where we show the existence of algebras with non-degenerate order.
Read the full abstract

Commutative Algebra

Graded Algebras over Polynomial Rings

Given a trivially graded polynomial ring $P_0=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=P_0[x_1,\dots,x_s]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal of $P$ satisfying $I\cap P_0=\{0\}$. The induced morphism $\Theta: {\rm Spec}(R)\rightarrow {\rm Spec}(P_0) = \mathbb{A}^m_K$ is used to prove that ${\rm Spec}(R)$ is connected. Next, we characterize and compute the following loci in $\mathbb{A}^m_K$: the set ${\rm Sing}_0(\Theta)$ of all points whose corresponding point in the zero section of $\Theta$ is singular in ${\rm Spec}(R)$, the set ${\rm Sing}_v(\Theta)$ of all points $\Gamma$ such that the origin of the fiber $F_\Gamma$ of $\Theta$ is singular, and the set ${\rm Sing}_s(\Theta)$ of all points $\Gamma$ such that $\dim({\rm Sing}(F_\Gamma))\ge 1$. Finally, we apply these results to MaxDeg border basis schemes. Their coordinate rings are non-negatively graded by the total arrow degree and satisfy the above hypotheses. In particular, we explicitly determine the singular loci of the $\mathcal{O}$-border basis schemes with $\mathcal{O} = \{1,x,y,z,z^2\}$ and $\mathcal{O} = \{1,x,y,z,yz\}$.
Read the full abstract

Optimization and Control

Existence of Quantum Splines via Fourth-Order Gradient Flows

We establish a rigorous existence theory for the quantum splines introduced by Brody, Holm, and Meier in Physical Review Letters (2012). These curves arise as solutions of a variational problem on the unitary group describing optimally controlled quantum evolutions. By formulating the problem within a geometric gradient flow framework for Riemannian spline interpolation, we construct a well-posed fourth order evolution whose asymptotic limits realize the desired quantum splines. The analysis requires adapting the variational structure to boundary conditions dictated by the physical model, which are not directly amenable to the setting in our recently developed framework for gradient flows of Riemannian spline interpolation. We show that, despite these difficulties, the modified system admits a rigorous analytical treatment, yielding both existence and a constructive procedure for generating quantum splines. Our results provide a mathematical foundation for the variational description of smooth quantum control trajectories and clarify the analytical structure underlying their formation.
Read the full abstract

Probability

Pfaffian structure of basin walls for coalescing particles

Coalescing particles on a line merge when they meet. As they do, their basins of attraction merge and the walls between basins disappear. If every site is initially occupied, these walls at any positive time form a Pfaffian point process: all correlation functions are determined by pairwise quantities arranged in antisymmetric matrices. Tribe, Zaboronski, Garrod, and Poplavskyi established this structure using analytic methods for time-homogeneous dynamics; our combinatorial approach works for any skip-free process (one where particles cannot change order without first meeting). We show that the Pfaffian structure lives naturally at the wall level: we prove an exact Pfaffian empty-interval formula for the walls and compute the cumulants of the wall indicators (higher-order analogs of the variance) as signed sums of probabilities that independent particles started at the interval endpoint positions reorder in specific ways. A structural property of these sums, indecomposability - every nonzero term couples all wall positions together - implies a central limit theorem for the wall count. A checkerboard duality identifies the walls of one process with the surviving particles of the dual process. This covers totally asymmetric dynamics and position-dependent transition rules, and for Brownian motion recovers the known Pfaffian point process.
Read the full abstract

Group Theory

Factors in infinite groups

Let $G$ be a group and $A\subseteq G$ a non-empty subset. A right $s$-factor associated with $A$ is a maximal subset $U\subseteq G$ such that the product $AU$ is direct. The lower and upper $s$-indices $|G:A|^-$ and $|G:A|^+$ are defined as the minimum and the supremum of the cardinalities of such maximal sets $U$. The subset $A$ is called stable if $|G:A|^- = |G:A|^+$, and $G$ is called stable if every subset of $G$ is stable. Using a graph-theoretic reformulation in terms of Cayley graphs, we prove that every infinite group is unstable. Equivalently, for every infinite group $G$ there exists a subset $A\subseteq G$ for which maximal subsets $U$ with direct product $AU$ do not all have the same cardinality. This gives a negative answer to Question 21.58 of the Kourovka Notebook.
Read the full abstract

Combinatorics · Cross-listed from cs.CG

Flip Distance Between Triangulations of Convex Polygons is NP-Complete

The complexity of determining the minimum number of flips that transform one triangulation of a convex polygon into another has been raised as an open problem by Culik and Wood [Inf. Proc. Letters 1982] and has been popularized through the study of extremal pairs of triangulations by Sleator, Tarjan, and Thurston [STOC 1986 & J. Am. Math. Society 1988]. The search for a hardness proof for the flip distance problem has yielded many (weaker) hardness-results in more general settings. Lubiw and Pathak [CCCG 2012, Comp. Geom. 2014] and Pilz [Comp. Geom. 2014] proved that computing the flip distance between triangulations of point sets in general position is NP-complete. Further, Aichholzer, Mulzer, and Pilz [ESA 2013, DCG 2015] proved that computing the flip distance between triangulations of simple polygons is NP-complete. The methods used to obtain these previous hardness results rely heavily on the geometric positioning of the vertices of the point set or the vertices of the polygon and are thus not feasible to prove NP-hardness for the flip distance problem of triangulations of convex polygons, where vertices are placed on a circle. We formulate a notion of conflict graphs for flip sequences between triangulations of convex polygons that allows us to use both geometric and combinatorial tools to study flip sequences. Large acyclic subsets of the conflict graph will correspond to short flip sequences. We show NP-completeness of the flip distance problem by proving that finding the largest acyclic subset of our conflict graphs is NP-complete.
Read the full abstract

Algebraic Topology

Learning Tangent Bundles and Characteristic Classes with Autoencoder Atlases

We introduce a theoretical framework that connects multi-chart autoencoders in manifold learning with the classical theory of vector bundles and characteristic classes. Rather than viewing autoencoders as producing a single global Euclidean embedding, we treat a collection of locally trained encoder-decoder pairs as a learned atlas on a manifold. We show that any reconstruction-consistent autoencoder atlas canonically defines transition maps satisfying the cocycle condition, and that linearising these transition maps yields a vector bundle coinciding with the tangent bundle when the latent dimension matches the intrinsic dimension of the manifold. This construction provides direct access to differential-topological invariants of the data. In particular, we show that the first Stiefel-Whitney class can be computed from the signs of the Jacobians of learned transition maps, yielding an algorithmic criterion for detecting orientability. We also show that non-trivial characteristic classes provide obstructions to single-chart representations, and that the minimum number of autoencoder charts is determined by the good cover structure of the manifold. Finally, we apply our methodology to low-dimensional orientable and non-orientable manifolds, as well as to a non-orientable high-dimensional image dataset.
Read the full abstract

Rings and Algebras

Ideals in Arbitrary Three-Dimensional Algebras

In this paper, we study arbitrary (not necessarily associative) 3-dimensional algebras. Such an algebra A is determined by a basis and the corresponding multiplication table, which is specified by 27 structure constants. We describe all ideals of A, providing an explicit characterization of both 1-dimensional and 2-dimensional ideals. Moreover, we classify 2-dimensional ideals into 4 distinct types. We prove that A either has infinitely many ideals or at most 4. We also show that, in any case, the maximum number of 1-dimensional ideals is 3, while the maximum number of 2-dimensional ideals is 2. Finally, we present a class of algebras with a finite number of ideals that attain this theoretical maximum.
Read the full abstract

Numerical Analysis

On $hp$-adaptive Structure-Preservation for the Cahn–Hilliard–Navier–Stokes Equations with Degenerate Mobility

We develop structure-preserving discontinuous Galerkin methods for the Cahn-Hilliard-Navier-Stokes equations with degenerate mobility. The proposed SWIPD-L and SIPGD-L methods incorporate parametrized mobility fluxes with edge-wise mobility treatments for enhanced coercivity-stability control. We prove coercivity for the generalized trilinear form and demonstrate optimal convergence rates while preserving mass conservation, energy dissipation, and the discrete maximum principle. Comparisons with existing SIPG-L and SWIP-L methods confirm similar stability. Validation on $hp$-adaptive meshes for both standalone Cahn-Hilliard and coupled systems shows significant computational savings without accuracy loss.
Read the full abstract

Differential Geometry · Cross-listed from hep-lat

Generalization of lattice Dirac operator index

We provide a comprehensive lattice formulation of various types of the Dirac operator indices, employing $K$-theory to classify the Wilson Dirac operator via its spectral flow. In contrast to the index of the overlap Dirac operator defined through the Ginsparg-Wilson relation, which is restricted to flat tori in even dimensions, our formulation offers several key advantages: 1) It can be applied straightforwardly to the Atiyah-Patodi-Singer index for manifolds with boundary. 2) The boundary can be curved, allowing for the inclusion of gravitational background effects. 3) The mod-2 index in both even and odd dimensions can be defined as a natural extension of the same formulation. In this talk, we present the mathematical proof and provide numerical evidence supporting the formulation.
Read the full abstract

All authors Shoto Aoki, Hajime Fujita, Hidenori Fukaya, Mikio Furuta, Shinichiroh Matsuo, Tetsuya Onogi, Satoshi Yamaguchi

Combinatorics

Results on three problems on isolation of graphs

The graph isolation problem was introduced by Caro and Hansberg in 2015. It is a vast generalization of the classical graph domination problem and its study is expanding rapidly. In this paper, we address a number of questions that arise naturally. Let $F$ be a graph. We show that the $F$-isolating set problem is NP-complete if $F$ is connected. We investigate how the $F$-isolation number $\iota(G,F)$ of a graph $G$ is affected by the minimum degree $d$ of $G$, establishing a bounded range, in terms of $d$ and the orders of $F$ and $G$, for the largest possible value of $\iota(G,F)$ with $d$ sufficiently large. We also investigate how close $\iota(G,tF)$ is to $\iota(G,F)$, using domination and, in suitable cases, the Erdos-Posa property.
Read the full abstract