Composable Uncertainty in Symmetric Monoidal Categories for Design Problems

This paper introduces a change-of-base construction using symmetric monoidal monads on Markov categories to extend symmetric monoidal categories of open systems, such as design problems, into 2-categories that compositionaly model various types of uncertainty while preserving their underlying structural properties.

Marius Furter (University of Zurich), Yujun Huang (Massachusetts Institute of Technology), Gioele Zardini (Massachusetts Institute of Technology)Wed, 11 Ma🔢 math

A Critical Pair Enumeration Algorithm for String Diagram Rewriting

This paper presents and proves the correctness of an algorithm that automates critical pair analysis for string diagram rewriting in symmetric monoidal categories (without Frobenius structure) by enumerating all critical pairs through concrete hypergraph manipulation.

Anna Matsui (Johns Hopkins University, USA), Innocent Obi (University of Washington, USA), Guillaume Sabbagh (University of Technology of Compiègne, France), Leo Torres (Universidad Nacional de Còrdoba, Argentina), Diana Kessler (Tallinn University of Technology, Estonia), Juan F. Meleiro (University of São Paulo, Brazil), Koko Muroya (National Institute of Informatics, Japan,Ochanomizu University, Japan)Wed, 11 Ma🔢 math

Scientific Rigor and Human Warmth: Remembering Vladimir Sidorenko (1949-2025)

This paper summarizes a memorial session held at the FFCS conference in Braunschweig honoring Dr. Vladimir Sidorenko (1949–2025), celebrating his profound scientific contributions to coding theory, cryptography, and quantum error correction alongside his cherished personal qualities of mentorship, humor, and generosity.

Christian Deppe, Haider Al Kim, Jessica Bariffi, Hannes Bartz, Minglai Cai, Pau Colomer, Gohar KyureghyanWed, 11 Ma🔢 math

Faster Stochastic ADMM for Nonsmooth Composite Convex Optimization in Hilbert Space

This paper proposes a stochastic alternating direction method of multipliers (ADMM) for nonsmooth composite convex optimization in Hilbert spaces, proving its strong convergence and establishing faster nonergodic convergence rates for both strongly and general convex cases, with applications demonstrated in PDE-constrained problems with random coefficients.

Weihua Deng, Haiming Song, Hao Wang, Jinda YangWed, 11 Ma🔢 math

Exponential Convergence of hphp-FEM for the Integral Fractional Laplacian on cuboids

This paper proves and numerically validates that tensor-product hphp-finite element approximations for the Dirichlet integral fractional Laplacian on a 3D cuboid with analytic forcing achieve root exponential convergence in the energy norm, specifically bounded by exp(bN6)\exp(-b\sqrt[6]{N}), by leveraging analytic regularity in weighted Sobolev spaces and geometrically refined meshes.

Björn Bahr, Markus Faustmann, Carlo Marcati, Jens Markus Melenk, Christoph SchwabWed, 11 Ma🔢 math

Rigidity of the dynamics of Aut(Fn){{\rm Aut}}({\mathsf{F}}_n) on representations into a compact group

This paper establishes that for a compact Lie group GG and sufficiently large rank nn, the dynamics of the automorphism group Aut(Fn){\rm Aut}({\mathsf{F}}_n) acting on the representation space Hom(Fn;G){\mathsf{Hom}}({\mathsf{F}}_n;G) exhibit algebraic rigidity, where orbit closures and invariant probability measures are algebraic in nature, analogous to Ratner's theorems.

Serge Cantat (IRMAR), Christophe Dupont (IRMAR), Florestan Martin-Baillon (MPI-MiS)Wed, 11 Ma🔢 math

Some polynomial classes for the acyclic orientation with parity constraint problem

This paper identifies three necessary conditions for the existence of acyclic T-odd orientations, defines and characterizes polynomial graph classes where these conditions are sufficient, and provides constructive polynomial-time algorithms to build such orientations for these classes and their Cartesian products.

Sylvain Gravier (IF, SFR MAM), Matthieu Petiteau (IF, SFR MAM), Isabelle Sivignon (GIPSA-GAIA, SFR MAM)Wed, 11 Ma🔢 math

Dirichlet control problems with energy regularization governed by non-coercive elliptic equations

This paper investigates linear-quadratic Dirichlet control problems governed by non-coercive elliptic equations on non-convex polygonal domains using energy regularization, establishing solution regularity in weighted Sobolev spaces and deriving optimal error estimates for finite element discretizations that employ graded meshes and a specialized discrete projection.

Thomas Apel, Mariano Mateos, Arnd RöschWed, 11 Ma🔢 math

Backward problem for a degenerate viscous Hamilton-Jacobi equation: stability and numerical identification

This paper establishes conditional stability for the backward problem of degenerate viscous Hamilton-Jacobi equations with general non-quadratic Hamiltonians using Carleman estimates and linearization, and proposes numerical identification algorithms based on the adjoint state method and Van Cittert iteration, validated by numerical tests.

S. E. Chorfi, A. Habbal, M. Jahid, L. Maniar, A. RatnaniWed, 11 Ma🔢 math