English
Related papers

Related papers: AC Simplifications and Closure Redundancies in the…

200 papers

Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…

Logic in Computer Science · Computer Science 2019-07-16 Beniamino Accattoli , Andrea Condoluci , Giulio Guerrieri , Claudio Sacerdoti Coen

Recently, it has become evident that submodularity naturally captures widely occurring concepts in machine learning, signal processing and computer vision. Consequently, there is need for efficient optimization procedures for submodular…

Machine Learning · Computer Science 2013-11-19 Stefanie Jegelka , Francis Bach , Suvrit Sra

Let ${\mathcal C}$ be a fixed equisingularity class of irreducible germs of complex analytic plane curves. We compute a basis of the ${\mathbb C}[[x]]$-module of K\"ahler differentials for generic $\Gamma \in {\mathcal C}$, algorithmically,…

Algebraic Geometry · Mathematics 2025-11-24 Pedro Fortuny Ayuso , Javier Ribón

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

First, we establish the relation between the associated varieties of modules over Kac-Moody algebras \hat{g} and those over affine W-algebras. Second, we prove the Feigin-Frenkel conjecture on the singular supports of G-integrable…

Quantum Algebra · Mathematics 2016-08-11 Tomoyuki Arakawa

For any 0-cell $B$ in a 2-category $\Bc$ we introduce the notion of adjoint algebra $\adj_B$. This is an algebra in the center of $\Bc$. We prove that, if $\ca$ is a finite tensor category, this notion applied to the 2-category of…

Quantum Algebra · Mathematics 2021-03-23 Noelia Bortolussi , Martín Mombelli

Matrices can be decomposed via rank-one approximations: the best rank-one approximation is a singular vector pair, and the singular value decomposition writes a matrix as a sum of singular vector pairs. The singular vector tuples of a…

Algebraic Geometry · Mathematics 2025-12-02 Alvaro Ribot , Emil Horobet , Anna Seigal , Ettore Teixeira Turatti

The classical Arazy's decomposition theorem provides a powerful tool in the study of sequences in (and isomorphisms on) a separable operator ideal $\mathcal C_E$ of the algebra $\mathcal B(H)$ of all bounded linear operators on the…

Functional Analysis · Mathematics 2026-02-11 Jinghao Huang , Fedor Sukochev , Zhizheng Yu

The expressiveness of dependent type theory can be extended by identifying types modulo some additional computation rules. But, for preserving the decidability of type-checking or the logical consistency of the system, one must make sure…

Logic in Computer Science · Computer Science 2020-11-02 Frédéric Blanqui

We study modular theory in hyperfinite von Neumann algebras, i.e. in those of type II or type III, from the viewpoint of a subregion charge sector decomposition. We address this symmetry resolution by considering infinite tensor products of…

High Energy Physics - Theory · Physics 2025-10-06 Giuseppe Di Giulio , Moritz Dorband , Johanna Erdmenger , Henri Scheppach

The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…

Representation Theory · Mathematics 2011-06-22 Toshiyuki Kobayashi

The tensor rank decomposition problem consists of recovering the unique set of parameters representing a robustly identifiable low-rank tensor when the coordinate representation of the tensor is presented as input. A condition number for…

Algebraic Geometry · Mathematics 2022-09-02 Nick Vannieuwenhoven

It is commonly agreed that the success of future proof assistants will rely on their ability to incorporate computations within deduction in order to mimic the mathematician when replacing the proof of a proposition P by the proof of an…

Logic in Computer Science · Computer Science 2007-07-10 Frédéric Blanqui , Jean-Pierre Jouannaud , Pierre-Yves Strub

The alternating minimization (AM) method is a fundamental method for minimizing convex functions whose variable consists of two blocks. How to efficiently solve each subproblems when applying the AM method is the most concerned task. In…

Optimization and Control · Mathematics 2015-01-16 Hui Zhang , Lizhi Cheng

We define a certain compactifiction of the general linear group and give a modular description for its points with values in arbitrary schemes. This is a first step in the construction of a higher rank generalization of Gieseker's…

Algebraic Geometry · Mathematics 2007-05-23 Ivan Kausz

Absolute model companionship (AMC) is a strict strengthening of model companionship defined as follows: For a theory $T$, $T_{\exists\vee\forall}$ denotes the logical consequences of $T$ which are boolean combinations of universal…

Logic · Mathematics 2022-12-06 Matteo Viale

We calculate the decomposition series of the D-module defined as the push-forward of a rank one linear system on the complement of a normal crossings hyperplane configuration and use data of a resolution of singularities to give a…

Algebraic Geometry · Mathematics 2009-05-18 Tilahun Abebaw , Rikard Bogvad

For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…

Representation Theory · Mathematics 2025-04-30 Alex Martsinkovsky

We study the indecomposable summands of the permutation module obtained by inducing the trivial $\mathbb{F}(S_a\wr S_n)$-module to the full symmetric group $S_{an}$ for any field $\mathbb{F}$ of odd prime characteristic $p$ such that…

Representation Theory · Mathematics 2014-04-18 Eugenio Giannelli

This paper presents an accelerated composite gradient (ACG) variant, referred to as the AC-ACG method, for solving nonconvex smooth composite minimization problems. As opposed to well-known ACG variants that are either based on a known…

Optimization and Control · Mathematics 2020-10-30 Jiaming Liang , Renato D. C. Monteiro