English
Related papers

Related papers: Multiple addition, deletion and restriction theore…

200 papers

#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polytope. In the realm of…

Logic in Computer Science · Computer Science 2015-10-30 Dmitry Chistikov , Rayna Dimitrova , Rupak Majumdar

We present a syntactic cut-elimination procedure for the alternation-free fragment of the modal mu-calculus. Cut reduction is carried out within a cyclic proof system, where proofs are finitely branching but may be non-wellfounded. The…

Logic in Computer Science · Computer Science 2025-10-14 Bahareh Afshari , Johannes Kloibhofer

In this paper, we recover the characteristic polynomial of an arrangement of hyperplanes by computing the rational equivalence class of the variety defined by the logarithmic ideal of the arrangement. The logarithmic ideal was introduced in…

Algebraic Geometry · Mathematics 2014-09-22 Graham Denham , Mehdi Garrousian , Mathias Schulze

Many studies of possible new physics employ effective field theory (EFT), whereby corrections to the Standard Model take the form of higher-dimensional operators, suppressed by a large energy scale. Fits of such a theory to data typically…

High Energy Physics - Phenomenology · Physics 2019-02-20 Christoph Englert , Michael Russell , Chris D. White

For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…

Algebraic Geometry · Mathematics 2024-10-15 Daniel Bath

The cost of the exact solution of the many-electron problem is believed to be exponential in the number of degrees of freedom, necessitating approximations that are controlled and accurate but numerically tractable. In this paper, we show…

Strongly Correlated Electrons · Physics 2017-03-02 Dominika Zgid , Emanuel Gull

We consider the free additive convolution $\mu_\alpha\boxplus\mu_\beta$ of two probability measures $\mu_\alpha$ and $\mu_\beta$, supported on respectively $n_\alpha$ and $n_\beta$ disjoint bounded intervals on the real line, and derive a…

Probability · Mathematics 2022-03-29 Philippe Moreillon , Kevin Schnelli

We present a rigorous derivation of a real space Full-Potential Multiple-Scattering-Theory (FP-MST), valid both for continuum and bound states, that is free from the drawbacks that up to now have impaired its development, in particular the…

Other Condensed Matter · Physics 2010-02-11 Keisuke Hatada , Kuniko Hayakawa , Maurizio Benfatto , Calogero R. Natoli

In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…

Logic · Mathematics 2024-11-19 Ben De Bondt , Alessandro Vignati

In 2011, Han and Ji proved addition-multiplication theorems for integer partitions, from which they derived modular analogues of many classical identities involving hook-length. In the present paper, we prove addition-multiplication…

Combinatorics · Mathematics 2022-09-08 David Wahiche

We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this…

Logic in Computer Science · Computer Science 2023-06-22 Jules Chouquet , Lionel Vaux Auclair

This paper intents to present the state of art and recent developments of the optimal transportation theory with many marginals for a class of repulsive cost functions. We introduce some aspects of the Density Functional Theory (DFT) from a…

Analysis of PDEs · Mathematics 2015-12-02 Simone Di Marino , Augusto Gerolin , Luca Nenna

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Combinatorics · Mathematics 2021-04-05 Elisa Palezzato , Michele Torielli

In this paper we consider space-time codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for…

Information Theory · Computer Science 2018-01-10 Laura Luzzi , Roope Vehkalahti

We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…

Logic in Computer Science · Computer Science 2025-09-11 Chad E. Brown , Cezary Kaliszyk , Martin Suda , Josef Urban

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

Perturbative calculations at next-to-next-to-leading order for multi-particle final states require a method to cancel infrared singularities. I discuss the subtraction method at NNLO. As a concrete example I consider the leading-colour…

High Energy Physics - Phenomenology · Physics 2009-11-10 Stefan Weinzierl

Inspired by Terao's freeness conjecture, we examine Ziegler pairs, which are pairs of hyperplane arrangements that share the same underlying matroid but have different modules of logarithmic derivations. In this paper, we present a general…

Combinatorics · Mathematics 2025-09-24 Takuro Abe , Lukas Kühne , Piotr Pokora

The study of theory combination in Satisfiability Modulo Theories (SMT) involves various model theoretic properties (e.g., stable infiniteness, smoothness, etc.). We show that such properties can be partly captured by the natural density of…

Logic in Computer Science · Computer Science 2025-05-23 Guilherme V. Toledo , Yoni Zohar

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple…

Information Theory · Computer Science 2021-02-22 Roope Vehkalahti , Laura Luzzi