arXiv Math @arxiv_math@qoto.org

We introduce derangetropy, a novel functional measure designed to characterize the dynamics of information within probability distributions. Unlike scalar measures such as Shannon entropy, derangetropy offers a functional representation that captures the dispersion of information across the entire support of a distribution. By incorporating self-referential and periodic properties, it provides deeper insights into information dynamics governed by differential equations and equilibrium states. Through combinatorial justifications and empirical analysis, we demonstrate the utility of derangetropy in depicting distribution behavior and evolution, providing a new tool for analyzing complex and hierarchical systems in information theory.

Key generation, a pillar in physical-layer security (PLS), is the process of the exchanging signals from two legitimate users (Alice and Bob) to extract a common key from the random, common channels. The drawback of extracting keys from wireless channels is the ample dependence on the dynamicity and fluctuations of the radio channel, rendering the key vulnerable to estimation by Eve (an illegitimate user) in low-entropy environments because of insufficient randomness. Added to that, the lack of channel fluctuations lower the secret key rate (SKR) defined as the number of bits of key generated per channel use. In this work, we aim to address this challenge by using a reconfigurable intelligent surface (RIS) to produce random phases at certain, carefully curated intervals such that it disrupts the channel in low-entropy environments. We propose an RIS assisted key generation protocol, study its performance, and compare with benchmarks to observe the benefit of using an RIS while considering various important metrics such as key mismatch rate and secret key throughput. Furthermore, we characterize a scaling law as a function of the rate of change of RIS phase switching for the average secret information rate under this protocol. Then, we use both the key throughput and information rate to optimize the overall secrecy rate. Simulations are made to validate our theoretical findings and effectiveness of the proposed scheme showing an improvement in performance when an RIS is deployed.

The next-generation wireless network, 6G and beyond, envisions to integrate communication and sensing to overcome interference, improve spectrum efficiency, and reduce hardware and power consumption. Massive Multiple-Input Multiple Output (mMIMO)-based Joint Communication and Sensing (JCAS) systems realize this integration for 6G applications such as autonomous driving, as it requires accurate environmental sensing and time-critical communication with neighboring vehicles. Reinforcement Learning (RL) is used for mMIMO antenna beamforming in the existing literature. However, the huge search space for actions associated with antenna beamforming causes the learning process for the RL agent to be inefficient due to high beam training overhead. The learning process does not consider the causal relationship between action space and the reward, and gives all actions equal importance. In this work, we explore a causally-aware RL agent which can intervene and discover causal relationships for mMIMO-based JCAS environments, during the training phase. We use a state dependent action dimension selection strategy to realize causal discovery for RL-based JCAS. Evaluation of the causally-aware RL framework in different JCAS scenarios shows the benefit of our proposed framework over baseline methods in terms of the beamforming gain.

Using the language of homotopy type theory (HoTT), we 1) prove a synthetic version of the classification theorem for covering spaces, and 2) explore the existence of canonical change-of-basepoint isomorphisms between homotopy groups. There is some freedom in choosing how to translate concepts from classical algebraic topology into HoTT. The final translations we ended up with are easier to work with than the ones we started with. We discuss some earlier attempts to shed light on this translation process. The proofs are mechanized using the Coq proof assistant and closely follow classical treatments like those by Hatcher.

In this paper, we consider the maximum $k$-edge-colorable subgraph problem. In this problem we are given a graph $G$ and a positive integer $k$, the goal to take $k$ matchings of $G$ such that their union contains maximum number of edges. This problem is NP-hard in cubic graphs, and polynomial time solvable in bipartite graphs as we observe in our paper. We present two NP-hardness results for two versions of this problem where we have weights on edges or color constraints on vertices. In fact, we show that these versions are NP-hard already in bipartite graphs of maximum degree three. In order to achieve these results, we establish a connection between our problems and the problem of construction of special maximum matchings considered in the Master thesis of the author and defended back in 2003.

Kennard, Khalili Samani, and Searle showed that for a $\mathbb{Z}_2$-torus acting on a closed, positively curved Riemannian $n$-manifold, $M^{n}$, with a non-empty fixed point set for $n$ large enough and $r$ approximately half the dimension of $M$, then $M^n$ is homotopy equivalent to $S^n$, $\mathbb{R}\mathrm{P}^{n}$, $\mathbb{C}\mathrm{P}^{\frac{n}{2}}$, or a lens space. In this paper, we lower $r$ to approximately $2n/5$ and show that we still obtain the same result.

We survey a selection of Yasha Eliashberg's contributions to the philosophy of the h-principle, with a focus on the simplification of singularities and its applications.

We consider the Brown measure of $a+\mathfrak{c}$, where $a$ lies in a commutative tracial von Neumann algebra $\mathcal{B}$ and $\mathfrak{c}$ is a $\mathcal{B}$-valued circular element. Under certain regularity conditions on $a$ and the covariance of $\mathfrak{c}$ this Brown measure has a density with respect to the Lebesgue measure on the complex plane which is real analytic apart from jump discontinuities at the boundary of its support. With the exception of finitely many singularities this one-dimensional spectral edge is real analytic. We provide a full description of all possible edge singularities as well as all points in the interior, where the density vanishes. The edge singularities are classified in terms of their local edge shape while internal zeros of the density are classified in terms of the shape of the density locally around these points. We also show that each of these countably infinitely many singularity types occurs for an appropriate choice of $a$ when $\mathfrak{c}$ is a standard circular element. The Brown measure of $a+\mathfrak{c}$ arises as the empirical spectral distribution of a diagonally deformed non-Hermitian random matrix with independent entries when its dimension tends to infinity.

Given a graph $H$, we say that a graph $G$ is properly rainbow $H$-saturated if: (1) There is a proper edge colouring of $G$ containing no rainbow copy of $H$; (2) For every $e \notin E(G)$, every proper edge colouring of $G+e$ contains a rainbow copy of $H$. The proper rainbow saturation number $\text{prsat}(n,H)$ is the minimum number of edges in a properly rainbow $H$-saturated graph. In this paper we use connections to the classical saturation and semi-saturation numbers to provide new upper bounds on $\text{prsat}(n,H)$ for general cliques, cycles, and complete bipartite graphs. We also provide some general lower bounds on $\text{prsat}(n,H)$ and explore several other interesting directions.

Let $R$ be a commutative ring. One may ask when a general $R$-module $P$ that satisfies $P \oplus R \cong R^n$ has a free summand of a given rank. M. Raynaud translated this question into one about sections of certain maps between Stiefel varieties: if $V_r(\mathbb{A}^n)$ denotes the Stiefel variety $\textrm{GL}(n) / \textrm{GL}(n-r)$ over a field $k$, then the projection $V_r(\mathbb{A}^n) \to V_1(\mathbb{A}^n)$ has a section if and only if the following holds: any module $P$ over any $k$-algebra $R$ with the property that $P \oplus R \cong R^n$ has a free summand of rank $r-1$. Using techniques from $\mathbb{A}^1$-homotopy theory, we characterize those $n$ for which the map $V_r(\mathbb{A}^n) \to V_1(\mathbb{A}^n)$ has a section in the cases $r=3,4$ under some assumptions on the base field. We conclude that if $P \oplus R \cong R^{24m}$ and $R$ contains a field of characteristic $0$, then $P$ contains a free summand of rank $2$. If $R$ contains a quadratically closed field of characteristic $0$, or the field of real numbers, then $P$ contains a free summand of rank $3$. The analogous results hold for schemes and vector bundles over them.

We prove upper bounds on outside probabilities for generic non-autonomous Schrödinger operators on lattices of arbitrary dimension. Our approach is based on a combination of commutator method originated in scattering theory and novel monotonicity estimate for certain mollified asymptotic observables that track the spacetime localization of evolving states. Sub-ballistic upper bounds are obtained, assuming that momentum vanishes sufficiently fast in the front of the wavepackets. A special case gives a refinement of the general ballistic upper bound of Radin-Simon's, showing that the evolution of wavepackets are effectively confined to a strictly linear light cone with explicitly bounded slope. All results apply to long-range Hamiltonian with polynomial decaying off-diagonal terms and can be extended, via a frozen-coefficient argument, to generic nonlinear Schrödinger equations on lattices.

A detailed analysis of density-functional theory for quantum-electrodynamical model systems is provided. In particular, the quantum Rabi model, the Dicke model, and a generalization of the latter to multiple modes are considered. We prove a Hohenberg-Kohn theorem that manifests the magnetization and displacement as internal variables, along with several representability results. The constrained-search functionals for pure states and ensembles are introduced and analyzed. We find the optimizers for the pure-state constrained-search functional to be low-lying eigenstates of the Hamiltonian and, based on the properties of the optimizers, we formulate an adiabatic-connection formula. In the reduced case of the Rabi model we can even show differentiability of the universal density functional, which amounts to unique pure-state v-representability.

We start from the classical Kadomtsev-Petviashvili hierarchy posed on formal pseudo-differential operators, and we produce two hierarchies of non-linear equations posed on non-formal pseudo-differential operators lying in the Kontsevich and Vishik's odd class, one of them with values in formal pseudo-differential operators. We prove that the corresponding Zakharov-Shabat equations hold in this context, and we express one of our hierarchies as the minimization of a class of Yang-Mills action functionals on a space of pseudo-differential connections whose curvature takes values in the Dixmier ideal. We finish by comparing our Kadomtsev-Petviashvili hierarchies in terms of the solutions that they produce to the KP-II equation: existence, uniqueness and formality.

Based on an algebraic point of view and the realization theory developed by Y. Yamamoto, the present paper states a necessary and sufficient criterion, given in the frequency domain, for the $L^q$ approximate controllability in finite time of linear difference delay equations with distributed delays. Furthermore, an upper bound for the minimal time of the $L^q$ approximate controllability is obtained.

For a simple graph $G$, the complement and the line graph of $G$ are denoted by $G^c$ and $L(G)$, respectively. In this paper, we show that for every simple connected regular graph $G$ with at least $5$ vertices, the graph $\mathcal{R}(G):=L(L(G)^c)^c$ is a Ramanujan graph with diameter at most three.

A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.Tărnăuceanu gave the formula to count the number of edges of these graphs. In this paper, we explore various properties of these graphs.

In this paper we propose the method to find the hitting probabilities for Gaussian integrators. Using second quantization we obtain the sseries representation for such probabilities despite the fact that integrators can be non-Markov processes.

Starting from the proof of the $C^0$-inextendibility of Schwarzschild by Sbierski, the past decade has seen renewed interest in showing low-regularity inextendibility for known spacetime models. Specifically, a lot of attention has been paid to FLRW spacetimes and there is an ever growing array of results in the literature. Apart from hoping to provide a concise summary of the state of the art we present an extension of work by Galloway and Ling on $C^0$-inextendibility of certain FLRW spacetimes within a subclass of spherically symmetric spacetimes, to $C^0$-inextendibility within a subclass of axisymmetric spacetimes. Notably our result works in the case of flat FLRW spacetimes with $a(t)\to 0$ for $t\to 0^+$, a setting where other known $C^0$-inextendibility results for FLRW spacetimes due to Sbierski do not apply.

We develop a Lie group geometric framework for the motion of fluids with permeable boundaries that extends Arnold's geometric description of fluid in closed domains. Our setting is based on the classical Hamilton principle applied to fluid trajectories, appropriately amended to incorporate bulk and boundary forces via a Lagrange-d'Alembert approach, and to take into account only the fluid particles present in the fluid domain at a given time. By applying a reduction by relabelling symmetries, we deduce a variational formulation in the Eulerian description that extends the Euler-Poincaré framework to open fluids. On the Hamiltonian side, our approach yields a bracket formulation that consistently extends the Lie-Poisson bracket of fluid dynamics and contains as a particular case a bulk+boundary bracket formulation proposed earlier. We illustrate the geometric framework with several examples, and also consider the extension of this setting to include multicomponent fluids, the consideration of general advected quantities, the analysis of higher-order fluids, and the incorporation of boundary stresses. Open fluids are found in a wide range of physical systems, including geophysical fluid dynamics, porous media, incompressible flow and magnetohydrodynamics. This new formulation permits a description based on geometric mechanics that can be applied to a broad class of models.

The asymptotic error distribution of numerical methods applied to stochastic ordinary differential equations has been well studied, which characterizes the evolution pattern of the error distribution in the small step-size regime. It is still open for stochastic partial differential equations whether the normalized error process of numerical methods admits a nontrivial limit distribution. We answer this question by presenting the asymptotic error distribution of the temporal accelerated exponential Euler (AEE) method when applied to parabolic stochastic partial differential equations. In order to overcome the difficulty caused by the infinite-dimensional setting, we establish a uniform approximation theorem for convergence in distribution. Based on it, we derive the limit distribution of the normalized error process of the AEE method by studying the limit distribution of its certain appropriate finite-dimensional approximation process. As applications of our main result, the asymptotic error distribution of a fully discrete AEE method for the original equation and that of the AEE method for a stochastic ordinary differential equation are also obtained.