Finite-dimensional operator algebras can be viewed as $\mathrm{C}^*$, $\mathrm{W}^*$, or $\mathrm{H}^*$-algebras, leading to different notions for their categories of modules and correspondence 2-categories. In this article, we show how these differences can be understood systematically using the notion of $G$-dagger category from arXiv:2403.01651 for different subgroups $G\leq O(2)$. To do so, we first introduce $G$-Hermitian $2$-vector spaces using fixed points of a certain $O(2)$-action on $2\mathsf{Vect}$. We then propose criteria for when such pairings are `positive', generalizing the passage from Hermitian vector spaces to Hilbert spaces. Finally, we outline an inductive approach to defining higher Hilbert spaces in arbitrary dimension, suggesting an extension of these ideas beyond the 2-categorical setting.

In this paper, we study the sharp bounds of the first three logarithmic inverse coefficients for Janowski convex class $\mathcal{C}(A, B)$. We also derive sharp upper and lower bounds of $\bigl|\,\gamma_2 \,\bigr|-\bigl|\,\gamma_1\,\bigr|$ and $\bigl|\,\Gamma_2 \,\bigr|-\bigl|\,\Gamma_1\,\bigr|$ for functions in the class $\mathcal{C}(A, B)$. Furthermore, a sharp estimate for the second Hankel determinant associated with the logarithmic inverse coefficients for functions in $\mathcal{C}(A, B)$ is obtained.

The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [10]. In [7], He and Jiang studied the Terwilliger $\mathbb{F}$-algebras of factorial association schemes. In this paper, we continue studying the Terwilliger $\mathbb{F}$-algebras of factorial association schemes. We get all block idempotents of the Terwilliger $\mathbb{F}$-algebras of factorial association schemes. We get the $\mathbb{F}$-dimensions, the centers, the Jacobson radicals of the block algebras of the Terwilliger $\mathbb{F}$-algebras of factorial association schemes.

We study the Alexander polynomials of the 4-strand Turk's head knots $Th(4,2n+1)$, defined as the closures of the braid $(\sigma_1\sigma_2^{-1}\sigma_3)^{2n+1}$. Using the reduced Burau representation, we derive an annihilating recurrence of order at most 8 and a rational generating function for the resulting polynomial sequence. By executing a multivariable resultant elimination over the reciprocal constraint, we obtain an exact factorization of the normalized Alexander polynomial in terms of Chebyshev polynomials. This factorization produces a binomial convolution formula for an associated coefficient sequence and a representation by a terminating ${}_4F_3$ hypergeometric series. We evaluate the continuous approximation of this representation using the saddle-point method, demonstrating negative curvature in the asymptotic main term. Finally, we describe analytic obstructions to extracting global discrete error bounds via this method, leaving the formal proof of Fox's Trapezoidal Conjecture for this family open.

This monograph develops probability and stochastic-process ideas as a translation language for statistics: from designed observations and data objects to targets, stability statements, inference, and use. The chapters move from motivating examples and randomization through probability measures, kernels, likelihoods, data objects, weak convergence, empirical fields, functional data, M- and Z-estimation, testing, local approximations, event-time processes, and prediction. Historical and biomedical examples are used to keep abstract objects tied to records, mechanisms, and decisions. The aim is to give readers a common grammar for classical probability, modern data structures, and statistical practice.

In 1916, Hausdorff proved that the Baire hierarchy on $\mathbb{R}$, starting with the continuous functions, generates all Borel functions on $\mathbb{R}$. It remained open whether, starting with the a.e. continuous functions, the corresponding hierarchy generates all Lebesgue measurable functions on $\mathbb{R}$. We prove that, assuming the Axiom of Choice, the answer is negative.

We tackle two key difficulties in the simulation of the viscous hydrodynamics of a large dense collection of rigid particles: (i) the poor convergence rate of an iterative solution of the discretized linear system as particle gaps shrink, and (ii) the large number of unknowns needed to accurately discretize the resulting lubrication-driven flows. Our focus is the 2D Stokes resistance and mobility boundary value problems for nearly-touching disks. To address both challenges, we introduce a general two-body preconditioning strategy, and implement it with the method of fundamental solutions. For each close particle pair, the hard-to-resolve interaction is represented in a basis precomputed by solving a local boundary value problem on a fine grid. In an iterative solve, the resulting flow field corrects that obtained from a coarse representation of all particles. The local fine-grid correction can even be compressed so that all particles except the pair itself are affected by an equivalent set of coarse sources. Numerical experiments demonstrate rapid GMRES convergence in challenging multi-particle settings, with iteration counts remaining low even in densely packed suspensions. For example, the mobility problem is solved for a random close packing with area fraction $\phi = 0.65$, $P = 10000$ monodisperse disks, and minimum separation $10^{-3}$, in just 47 GMRES iterations, achieving five digits of accuracy with 72 vector unknowns per body.

The $K$-th nearest neighbor random walk $(X_n)_{n \geq 0}$ on a homogeneous Poisson point process $\chi$ on $\R^d$ ($d\geq 1$), starts at the origin and at each step picks its next Poisson point among its closest neighbors according to i.i.d. labels having the same distribution as $K$. Our main result (Theorem 1) states that the number of Poisson points visited by $(X_n)_{n \geq 0}$ admits an exponential decay whenever the random variable $K$ has a bounded support (BS). In particular, the $K$-th nearest neighbor random walk visits finitely many Poisson points if and only if $K$ satisfies Assumption (BS). To prove it, we introduce the key notion of pioneer point which allows us to deal with the region of $\R^d$ already explored by $(X_n)_{n \geq 0}$. Still under Assumption (BS), we also prove an exponential decay for the Euclidean length of the trajectory performed by $(X_n)_{n \geq 0}$ (Theorem 2). Finally, and quite surprisingly, we exhibit an example of label distribution with bounded support for which the $K$-th nearest neighbor random walk discovers new Poisson points after a number of steps whose tail distribution is at least polynomial (Theorem 3).

Spectral methods rely fundamentally on the stability of principal eigenspaces under random perturbations. Classically, this stability is quantified by the Davis-Kahan and Wedin theorems, which bound the eigenspace error using the operator norm of the noise and the relevant spectral gaps. While these worst-case bounds are sharp for arbitrary deterministic perturbations, they can be wasteful in the low-rank signal-plus-random-noise setting, as they fail to capture the fine-grained interaction between the signal geometry and the noise distribution. In this paper, we study the spectral perturbation of signal-plus-noise matrices corrupted by sparse, random noise with an arbitrary, inhomogeneous variance profile. We demonstrate that under heterogeneous noise variances, the empirical eigenvectors suffer a systematic, deterministic geometric bias that is entirely invisible to classical perturbation bounds. By leveraging the Quadratic Vector Equation (QVE) and establishing fine-grained isotropic local laws, we derive near-optimal, non-asymptotic perturbation bounds for the leading eigenspaces in the operator and $2\to\infty$ norms. The bounds separate the usual signal-to-noise contribution, stochastic fluctuations, and structured geometric bias terms determined by the alignment between the signal eigenspaces and the row-wise variance profile.

For groups without strict hierarchy, collective decisions often emerge through compromise. We develop a second-order network model of collective decision-making using a dissipative Hamiltonian formulation, in which informed agents introduce preferred directions while uninformed participants contribute only direction-free dissipation. We show that under low conflict, the model admits a locally unique, exponentially stable compromise state. Using a structured modular network we further show that as conflict increases the local compromise branch terminates through a saddle-node fold rather than through a smooth mean-field symmetry-breaking transition. Modular polarized states persist on branches that are locally separated from the compromise branch. Direction-free dissipation does not shift the static structural threshold, but it delays escape from the saddle-node ghost and pushes the observable onset of polarization to larger conflicts. Our work identifies a dissipation-mediated mechanism, complementary to connectivity-based accounts, through which uninformed participants stabilize collective behavior in biological and engineered swarms.

The Schramm-Loewner Evolution (SLE) describes a family of fractal curves that arise in the study of the scaling limits of many planar Statistical Physics models. These curves are modeled using the Loewner Differential Equation for the conformal maps $g_t(z)$ with a Brownian motion driver. Using Euler's Method, in the current work we performed numerical experiments to study at a fixed time the quantities $|g_t(z) - \overline{g_t(z)}|$ and $Re(g_t(z)) - Re(\overline{g_t(z)})$, where $Re$ denotes the real part and $\overline{g_t(z)}$ refers to the sample average. These random variables measure the 'spread' of the dynamics from the average behavior at fixed time. One of the scopes of this work is to give numerical predictions for future theoretical investigations on these quantities. When investigating these quantities in the SLE case our experiments predict that the distribution is bimodal when the dynamics started close to the origin, and it can become bell-shaped if the dynamics is started further from the origin. In the second part, we performed experiments for a Multiple SLE model whose driver is Dyson Brownian Motion. Due to singularity in the dynamics of the drivers and the many data points needed, this part is challenging from a computational perspective. In the multiple SLE case, our experiments predict that the distribution is bell-shaped in all cases. In addition, we check the changes in the distributions as we vary the parameter $\kappa$ in the SLE case and $\beta$ in the Multiple SLE case.

We consider the enumeration of $N$-ary convex structures on finite sets. Our main result shows that the total number of convexities is expressed as the binomial transform of the sequence of numbers of grounded convexities. We present the exact numbers of all $N$-ary and grounded $N$-ary convexities for $|X|\leqslant 5$. The obtained integer sequences have been cross-referenced with the OEIS. As a result, we identified both known sequences (such as A000798) and new ones not previously listed.

Using a sequence of high-school level mathematics questions that were not available on the Internet, we compare the performance of the popular AI software Claude with that of my friends and fellow human beings Pierre and Catherine. Pierre had solid scientific training as a young man, while Catherine studied literature. All three were subjected to a simulated pre-calculus oral exam with main questions and follow-up questions. Their performances are compared and the ones with the best and worst performances are identified. The outcome is that the current version of Claude, even though it is an extremely useful tool that has probably recorded the solution to nearly all calculus questions that are available on the Internet, {\em exhibits only a very limited understanding of the subject} and {\em does not exhibit the ability to make intelligent connections} between different features of a pre-calculus mathematics problem that it has never seen before.

We study degree-one persistent homology of the planar Wiener-sausage filtration generated by standard Brownian motion without drift. In the drifted case, regeneration along the drift direction leads to linear-in-time laws for persistent-homological observables. In the recurrent zero-drift case, this renewal structure disappears. The organizing mechanism is instead Brownian self-similarity: the persistence diagram at time $T$ is equal in law to the image of the unit-time diagram under spatial dilation by $\sqrt T$. Consequently, large-time questions on fixed radius windows are transformed into small-radius questions for the unit-time Brownian trace. Let $B$ be standard planar Brownian motion, let $K_T=B\left(\left[0,T\right]\right)$, and let $K_T^{\left(r\right)}$ be the radius-$r$ Wiener sausage. Since $K_T^{\left(r\right)}$ is connected, its first Betti number $\beta_1^T\left(r\right)$ is the number of bounded complementary components of $K_T^{\left(r\right)}$. For a bounded nonnegative Borel function $\psi$ supported in a compact interval $\left[a,b\right]\subset\left(0,\infty\right)$, we consider the smoothed Betti-curve observable $\left[r_0,r_1\right] \mathrm{\Phi}_\psi \left(T\right) = \int_{r_0}^{r_1} \beta_1^T \left( r \right) \psi \left( r \right) dr$. We prove that there exist absolute constants 0

This paper bridges combinatorial geometry and music theory to solve the fundamental challenge of embedding classical Western harmony into the microtonal 19-tone equal temperament (19-TET). Inspired by Roger Penrose's observations on the mathematical elegance of 19-TET, we provide the theoretical foundation for a physical 19-TET acoustic piano currently under construction. However, playing classical 12-TET music on such an instrument poses a topological problem: emvedding the classical Euler-Riemann Tonnetz into the 19-TET universe inevitably distorts structural chords, creating dissonant ``wolves.'' By formalizing these harmonic spaces as incidence configurations (the 12_3 and 19_3 graphs) and utilizing integer cuts in our optimization model, we exhaustively prove that exactly 32 out of 36 Neo-Riemannian harmonic connections can be preserved. We demonstrate a strict 5-fold degeneracy of this optimum: there exist exactly 5 mathematically equivalent local packings for the wolf chords. Among these, we identify a unique canonical realization in which the 14 excised vertices form a perfectly contiguous geometric void along the primary Hamiltonian cycle. We reveal that the 4 inevitably broken edges represent the exact topological scars of the historical enharmonic diesis, and we formulate the Vicentino Hypothesis regarding 16th-century microtonal composition. Finally, to make this theoretical geometry physically playable, we design a novel 19-TET split-key keyboard, formalized through a biomechanical cost function that optimizes the performer's hand span. This work provides the complete theoretical, historical, and ergonomic blueprint for the next generation of microtonal acoustic instruments.

We study Bermudan option pricing under the Gatheral Double Mean-Reverting (GDMR) stochastic volatility model. The model features a variance process together with a stochastic long-run mean variance process and allows Constant Elasticity of Variance (CEV)-type exponents in the diffusion coefficients. This model is attractive since it provides a flexible specification for volatility dynamics. However, the pricing of early-exercise derivatives under the GDMR model remains largely unexplored in the literature. To address this challenge, we adapt a Hybrid Least-Squares Monte Carlo-Partial Differential Equation (LSMC-PDE) framework to the GDMR model and provide a detailed model-specific implementation. Conditioning on simulated variance paths, the pricing problem reduces to a one-dimensional problem in the asset price, which is solved by a Fourier-based approach, while the remaining dependence on the variance variables is approximated by least-squares regression. Our numerical experiments demonstrate that the Hybrid LSMC-PDE approach yields accurate pricing estimates and often lower pricing errors than plain LSMC, particularly for low and moderate numbers of simulation paths, showing the benefit of using the model structure in early-exercise option pricing.

Efficient thermal management is critical for the reliability and performance of power electronics systems in automotive applications. This work presents a computationally efficient modeling approach for transient thermal simulation of power electronic systems, with a focus on inverter modules using multiple MOSFETs mounted on a printed circuit board assembly (PCBA). A case study of an inverter module comprising six MOSFETs arranged as high-side and low-side pairs for a three phases system mounted on a PCBA, attached to a heat sink is considered. Computational fluid dynamic (CFD) simulations in Ansys Icepak are performed considering different heat transfer mechanisms, including natural convection, forced convection at constant velocity, and forced convection with varying flow velocity. A transient thermal model is developed using the Lumped Parameter Linear Superposition (LPLSP) method, a hybrid approach that combines lumped parameter modeling with the principle of linear superposition to capture transient thermal behavior efficiently. Temperatures of the components from the simulations are compared with temperatures from the LPLSP model and temperatures from a Linear Time Invariant (LTI) based reduced order model (ROM) developed for this system. It is observed that the LPLSP model is able to model a wide range of use cases very accurately with error of less than 5 %. This method enables rapid thermal performance evaluation of power electronics systems that have very fast transients in component level power dissipation and variations in ambient conditions, making it particularly well-suited for early-stage design iterations and long-duration mission profile simulations. The approach offers a practical path to reducing development cycles for automotive power electronics design.

Biquadratic forms arise naturally in polynomial optimization, tensor analysis, and quantum information theory. A key problem is determining the minimal number of squares needed in a sum-of-squares (SOS) representation of such a form, known as its SOS rank. For fixed dimensions $(m,n)$, the maximum possible SOS rank over all biquadratic forms in $m$ and $n$ variables is denoted $\operatorname{BSR}(m,n)$. Recent advances have established lower bounds on $\operatorname{BSR}(m,n)$ via combinatorial constructions involving bipartite graphs and the orthogonality method. In particular, for the case $(m,n)=(5,4)$, it was shown that $\operatorname{BSR}(5,4)\ge 11$ using only nondegenerate 2-edges. In this paper, we extend this framework by incorporating a degenerate $2$-edge, which introduces a cross term where the two $y$-indices coincide. We construct an explicit $5\times 4$ biquadratic form and apply the orthogonality method to prove that its SOS rank is $12$, thereby improving the lower bound to $\operatorname{BSR}(5,4)\ge12$. This result demonstrates that degenerate $2$-edges yield additional algebraic flexibility beyond purely combinatorial bounds and extends the applicability of the orthogonality method to forms with cross terms involving identical $y$-indices.

This thesis studies the convergence of finite-population stochastic evolutionary dynamics to their deterministic mean-field limit in continuous-time finite state space games. We first develop refined ergodic theorems for Markov chains with a single positive-recurrent class, guaranteeing the existence of a unique invariant distribution and almost-sure convergence of time averages. Next, we prove that the mean-field model, described by a system of Lipschitz-continuous ordinary differential equations, admits a unique solution that depends continuously on its initial condition and that constitutes the almost-sure limit for the empirical distributions with fixed policy. Furthermore, we show that every Mixed Stationary Nash Equilibrium of the mean-field game is approximated by a Nash equilibrium of the corresponding $N$-player game within an error $\epsilon$ for sufficiently large $N$. We finally demonstrate, by Kurtz's theorem, that the empirical state-policy distribution converges in probability to the mean-field trajectory. Numerical simulations conducted in MATLAB confirm the theoretical $\mathcal{O}(N^{-1/2})$ convergence rate in both models across a range of population sizes.

We study restless bandits with binary latent states and imperfect binary feedback, motivated by opportunistic spectrum access with sensing errors. For the associated belief-state model, we develop a partial conservation laws (PCL)-based analytical and computational framework for establishing indexability and evaluating the Whittle index, building on a verification theorem for real-state discounted restless bandits. The framework analyzes the stochastic dynamics via an associated deterministic skeleton, renewal decompositions, and combinatorics on words. It yields tractable expressions for discounted reward and resource metrics in several threshold regimes, enabling full verification of the PCL-indexability conditions there. For the remaining regime, where a complete analytic verification is not achieved in this paper, we derive efficient numerical schemes for computing the relevant marginal metrics and the marginal productivity (MP) index, which equals the Whittle index when those conditions hold. Extensive computational experiments provide strong evidence that these conditions also hold in that regime across broad parameter ranges and without the stringent parameter restrictions imposed in prior work. The experiments further show that theMP index policy typically outperforms standard benchmark policies, often by a substantial margin.

While discrete-time Stochastic Portfolio Theory (SPT) provides a robust framework for market analysis, existing work on functional generation has predominantly focused on long-only portfolios defined on the entire unit simplex. This paper extends the geometric framework of functional generation to the broader class of bankruptcy-proof long-short portfolios defined on local market state spaces. We establish that, within this admissible setting, pseudo-arbitrage is fully characterized by the concavity of the generating function on the market state space, thereby relaxing the usual global domain requirement. A central contribution of this work is a geometric characterization of the short-selling mechanism. We prove that the presence of short selling is equivalent to the negativity of the maximal concave extension of the generating potential. This phenomenon is linked to the steepness of the logarithmic gradient as the market approaches a zero boundary nested inside the simplex. To systematically exploit this mechanism, we introduce the barycentric scaling transformation, a constructive methodology that maps classical long-only generating functions onto restricted domains to engineer admissible strategies with controlled short-selling exposure. Finally, through the analysis of specific shrunken portfolios, we identify a geometric phase transition: under suitable boundary conditions, admissible strategies exhibit a long-only core and a short-selling region in a qualitative sense (without asserting an exact partition of the state space). This provides a unified geometric perspective on relative arbitrage beyond the long-only constraint.

We consider the $SO(d)$ and $O(d)$ invariant sectors of the bosonic $d$-matrix harmonic oscillator with $U(N)$ gauge symmetry. The micro-canonical degeneracy $\mathcal{Z}( N, d, k )$ for fixed energy $k$ is expressed as a pairing between an $N$-dependent vector and a $d$-dependent vector in the space of partitions of the integer $k$. This pairing formula is derived by counting invariant words in multi-matrix variables $X^i_{j,a}$, using properties of Clebsch-Gordan multiplicities (Kronecker coefficients) for the symmetric group $S_k$, Schur-Weyl duality and harmonic analysis on the homogeneous space $U(d)/SO(d)$. Analytic formulae for large $N$ and $k$ with $ k \le N $ are obtained using group integrals over $U(N)$ and $SO(d)$ (or $ O(d)$). The micro-canonical heat capacity in this regime is negative and turns positive, at a critical value $k_{\rm crit}$, due to finite $N$ modifications to the counting, thus forming what we denote as a characteristic caloric fold in the $ E $ versus $T$ curve. Data from the pairing formula is well fitted by $k_{\rm crit} \sim { N^2 \over 4 }$ for small values of $d$. A derivation of this large $N$ formula is given using a matrix model approximation and semi-classical analysis of the eigenvalue density. The large $N,d$ limit of the degeneracies reveals a key role for ribbon graph combinatorics. The caloric fold is also notably a property of black hole thermodynamics in anti-de-Sitter spaces. We propose the spherically symmetric \(SO(d)\) and \(O(d)\) invariant sectors of \(d\)-matrix quantum mechanics as tractable matrix systems for capturing key features of dual descriptions of black-hole thermodynamics.

Public-key cryptosystems eliminate the requirement for pre-shared secret keys by enabling encryption with a publicly disclosed key and decryption with a corresponding private key. In this article we generalize the public-key cryptosystems to ternary algebraic structures, with particular attention to ElGamal as a representative family. We introduce the necessary algebraic background for nonderived ternary structures, including special elements, ternary group rings, and a matrix ternarization procedure that maps binary rings and group rings to antidiagonal symbolic matrices closed under ternary multiplication. Building on these foundations, we formulate a ternary analogue of the ElGamal three-step protocol (key generation, ephemeral encryption, and decryption via querelements) and derive explicit ternary power and querelement formulas that enable correct decryption. Concrete instantiations and numerical examples over a ternary fraction field, a matrix-ternarized finite group ring, and a finite \((6,3)\)-ring (field) validate the construction and illustrate admissible word-length quantization and cycle behaviour of ternary powers. The ternary framework highlights two practical advantages: richer algebraic structure (querelements replace binary inverses) that increases algebraic complexity for attackers, and higher information density (matrix ternarization transfers paired/plaintext vectors). Formal hardness assumptions, optimized parameter choices, and comprehensive security and performance analyses remain necessary future work.

Motivated in part by anomaly cancellation for integral charge spectra in chiral gauge theory, we study the symmetric locus in the ideal degree-three Prouhet-Tarry-Escott problem. A symmetric integer solution is one whose entries are paired about a common center $c\in \frac12\mathbb Z$. This symmetry reduces the problem to a sum-of-two-squares equation, $x^2+y^2=u^2+v^2$, in integer variables, subject to the appropriate parity conditions. Thus the problem is governed by representations as sums of two squares. For the full symmetric locus, let $N_{\mathrm{sym}}(H)$ denote the number of nontrivial symmetric integer solutions of height at most $H$, counted with unordered multiset conventions and summed over the admissible centers. Then \begin{align*} N_{\mathrm{sym}}(H) = \frac{4\log 2}{3\pi^2}H^3\log H+O(H^3). \end{align*} The logarithmic enhancement comes from the second moment of the sum-of-two-squares representation function. In particular, the symmetric locus is larger than one would expect from the naive $H^3$ degree-weighted box-counting scale alone. This asymptotic identifies a large arithmetically structured subfamily of the ideal degree-three solution space, and suggests that paired anomaly-free integral charge spectra reflect a fundamental number-theoretic structure.

We study a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers in a discrete-time setting. In each period, a customer arrives seeking service, and the platform chooses an assortment of sellers to display. The customer then proposes a transaction to at most one seller in the assortment according to a multinomial logit choice model. After a fixed number of periods, sellers review the proposals they have received and each chooses at most one customer according to another multinomial logit choice model, after which the cycle repeats. A key challenge is that the platform does not know the choice-model parameters of either customers or sellers in advance. To our knowledge, this is the first study of a dynamic assortment problem in which both sides' choice parameters are unknown. We develop a data-driven algorithm that learns these parameters while optimizing the platform's objective over time. We evaluate performance using regret, which measures revenue loss relative to a clairvoyant benchmark that knows all parameters and customer arrivals in advance. We show that the algorithm's worst-case regret grows polylogarithmically over time, and we derive a matching lower bound, establishing its rate optimality.

The Graph Burning Problem (GBP) is a NP-Hard combinatorial optimization problem that models the propagation of influence or contagion in a network. The propagation is represented through the metaphor of a fire spreading through the vertices of a graph. A burning process takes place in a series of discrete time-steps. At each time step, the burning process is characterized by a propagation (where burned nodes spread the fire to their neighbors), and an ignition (where one additional unburned node is chosen to become burned). The minimum number of steps required to burn all vertices of a graph defines its burning number. Literature provides integer linear programming formulations to solve the problem, but with no surprise, such approaches struggle to converge as the graph size increases. Therefore, reducing the search space explored by these formulations becomes a key point to improve performances. In this work, we study the similarities of the Graph Burning Problem with the well-known Dominating Set Problem. We propose a new formulation based on this study and apply dominance rules and symmetry-breaking techniques to reduce the search space and consequently speed up resolution time. We also introduce a perturbation of the proposed objective function, as well as a pruning rule for the perturbed model in order to further accelerate its resolution.

Let $\Sigma$ be a closed embedded minimal hypersurface in $\mathbb{S}^{n+1}$. We establish an improved lower bound for the first non-zero eigenvalue of the induced Laplace-Beltrami operator on $\Sigma$. It is slightly better than the bound of Duncan-Sire-Spruck.

In this paper, we develop a quiver approach to coquasi-Hopf algebras with the dual Chevalley property. We introduce a modified generalized path coalgebra $\Bbbk(\mathrm{Q},\mathcal{S})$ associated with a given quiver $\mathrm{Q}$ and a collection of simple coalgebras $\mathcal{S}=\{C_i\mid i\in \mathrm{Q}_0\}$ indexed by the vertices of $\mathrm{Q}$, such that its link quiver coincides with $\mathrm{Q}$. We prove that such a coalgebra admits a graded coquasi-Hopf algebra structure with the dual Chevalley property if and only if $\mathrm{Q}$ is a generalized Hopf quiver and $\bigoplus_{i\in \mathrm{Q}_0}C_i$ forms a cosemisimple coquasi-Hopf algebra. Moreover, we provide a classification of these coquasi-Hopf algebra structures. We then study the link-indecomposable components of a coquasi-Hopf algebra with the dual Chevalley property, and give the generalized dual Gabriel's theorem for such coquasi-Hopf algebras. As an application, we apply the quiver method to classify finite integral tensor categories with the Chevalley property of finite representation type. We also give structural characterizations of coradically graded coquasi-Hopf algebras of tame corepresentation type. Furthermore, we investigate finite braided integral tensor categories with the Chevalley property via the quiver approach.

Let $G$ be a finite group and $p$ a prime. It is interesting to determine when two ordinary irreducible representations of $G$ have the same $p$-modular reduction; this is the same as saying that the corresponding rows of the decomposition matrix are equal, or that the characters of the two representations agree on $p$-regular conjugacy classes. In fact we consider the more general problem of asking when two rows of the decomposition matrix are proportional. In the case where $G$ is a double cover of the alternating or symmetric group, this problem has been solved except when $p=3$. Here we resolve the missing case for spin characters (i.e. characters which are not lifted from the covered group), which completely solves the problem for the double cover of the symmetric group. There are surprising parallels to our solution to the corresponding problem for $p=2$.

We classify when a spin and a non-spin irreducible character of the alternating group have proportional 2-modular reductions. Equivalently, we classify when such a pair of characters are proportional on elements of odd order.