Related papers: Block-Decomposition for 3-Parameter Persistence Mo…
We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…
We are concerned with the study of the Cauchy problem to the 3D compressible Hall-magnetohydrodynamic system. We first establish the unique global solvability of strong solutions to the system when the initial data are close to a stable…
Persistence modules are representations of products of totally ordered sets in the category of vector spaces. They appear naturally in the representation theory of algebras, but in recent years they have also found applications in other…
Block coordinate methods have been extensively studied for minimization problems, where they come with significant complexity improvements whenever the considered problems are compatible with block decomposition and, moreover, block…
Coarse-grained theories of dense polymer liquids such as block copolymer melts predict a universal dependence of equilibrium properties on a few dimensionless parameters. For symmetric diblock copolymer melts, such theories predict a…
Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…
We consider whether conditions exist under which block-coordinate descent is asymptotically efficient in evolutionary multi-objective optimization, addressing an open problem. Block-coordinate descent, where an optimization problem is…
Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are…
Bounds on the reliability function for the discrete memoryless relay channel are derived using the method of types. Two achievable error exponents are derived based on partial decode-forward and compress-forward which are well-known…
The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…
Superdeformed nuclei in the 190 mass region exhibit a striking universality in their decay-out profiles. We show that this universality can be explained in the two-level model of superdeformed decay as related to a strong separation of…
In this paper, we complement recent results of Bronski and Johnson and of Johnson and Zumbrun concerning the modulational stability of spatially periodic traveling wave solutions of the generalized Korteweg-de Vries equation. In this…
For any prime p, we construct, and simultaneously count, all of the complex Specht modules in a given p-block of the symmetric group which remain irreducible when reduced modulo p. We call the Specht modules with this property p-irreducible…
This paper is devoted to the stability analysis of a classical three-field formulation of Biot's consolidation model where the unknown variables are the displacements, fluid flux (Darcy velocity), and pore pressure. Specific…
For each $d\geq 0$, we prove decoupling inequalities in $\mathbb R^3$ for the graphs of all bivariate polynomials of degree at most $d$ with bounded coefficients, with the decoupling constant depending uniformly in $d$ but not the…
In this paper, persistence properties of solutions are investigated for a 4-parameter family ($k-abc$ equation) of evolution equations having $(k+1)$-degree non-linearities and containing as its integrable members the Camassa-Holm, the…
We give a decomposition as a direct sum of indecomposable modules of several types of Specht modules in characteristic $2$. These include the Specht modules labelled by hooks, whose decomposability was considered by Murphy. Since the main…
Quantum low-density parity-check (QLDPC) codes offer a promising path to low-overhead fault-tolerant quantum computation but lack systematic strategies for exploration. In this Letter, we establish a topological framework for studying the…
Block coordinate descent is an optimization paradigm that iteratively updates one block of variables at a time, making it quite amenable to big data applications due to its scalability and performance. Its convergence behavior has been…
We consider the demixing problem of two (or more) high-dimensional vectors from nonlinear observations when the number of such observations is far less than the ambient dimension of the underlying vectors. Specifically, we demonstrate an…