English
Related papers

Related papers: On Formality and Combinatorial Formality for hyper…

200 papers

We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical…

Logic · Mathematics 2023-03-24 Mark Kamsma

The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…

Combinatorics · Mathematics 2025-12-12 Masamichi Kuroda , Norihiro Nakashima , Shuhei Tsujie

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

Logic · Mathematics 2013-04-15 Vera Koponen

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

Logic · Mathematics 2008-02-03 Saharon Shelah

We define arrangements of codimension-1 submanifolds in a smooth manifold which generalize arrangements of hyperplanes. When these submanifolds are removed the manifold breaks up into regions, each of which is homeomorphic to an open disc.…

Combinatorics · Mathematics 2014-03-04 Priyavrat Deshpande

The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed…

Metric Geometry · Mathematics 2007-10-02 Antoine Deza , Feng Xie

We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thi\'ery and the second author. A…

Combinatorics · Mathematics 2023-12-12 Djamila Oudrar , Maurice Pouzet

The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide…

Algebraic Geometry · Mathematics 2026-04-08 Elia Mazzucchelli , Dmitrii Pavlov , Kexin Wang

Field theoretical models with first order Lagrangean can be formulated in a covariant Hamiltonian formalism. In this article, the geometrical construction of the Gerstenhaber structure that encodes the equations of motion is explained for…

Mathematical Physics · Physics 2009-11-07 Cornelius Paufler

Fusion categories are fundamental objects in quantum algebra, but their definition is narrow in some respects. By definition a fusion category must be k-linear for some field k, and every simple object V is strongly simple, meaning that (V)…

Quantum Algebra · Mathematics 2019-09-16 Greg Kuperberg

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…

Formal Languages and Automata Theory · Computer Science 2010-10-27 Arseny M. Shur

Given an ordered field $\mathbb{T}$ of formal series over an ordered field $\mathbf{R}$ equipped with a composition law $\circ \colon \mathbb{T} \times \mathbb{T}^{>\mathbb{R}} \longrightarrow \mathbb{T}$, we give conditions for…

Logic · Mathematics 2025-09-12 Vincent Bagayoko

Manin and Schechtman introduced a family of arrangements of hyperplanes generalizing classical braid arrangements, which they called the $\textit{discriminantal arrangements}$. Athanasiadis proved a conjecture by Bayer and Brandt providing…

Combinatorics · Mathematics 2023-08-01 So Yamagata

A discriminantal hyperplane arrangement B(n,k,A) is constructed from a given (generic) hyperplane arrangement A, which is classified as either very generic or non-very generic depending on the combinatorial structure of B(n,k,A). In…

Combinatorics · Mathematics 2026-03-25 Pragnya Das , Takuya Saito , Simona Settepanella

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

It is shown that an ensemble of particles with tripolar (colour) charges will necessarily cohere in a hierarchy of structures, from simple clusters and strings to complex aggregates and cyclic molecule-like structures. The basic…

General Physics · Physics 2007-05-23 V. N. Yershov

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

Combinatorics · Mathematics 2018-05-22 Matěj Konečný

In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…

Quantum Physics · Physics 2026-02-19 Olivier Brunet

We explore a natural extension of braid arrangements in the context of determinantal arrangements. We show that these determinantal arrangements are free divisors. Additionally, we prove that free determinantal arrangements defined by the…

Algebraic Geometry · Mathematics 2015-07-14 Arnold Yim

Since Edmund Husserl coined the term "Formal Ontologies" in the early 20th century, a field that identifies itself with this particular branch of sciences has gained increasing attention. Many authors, and even Husserl himself have…

Artificial Intelligence · Computer Science 2025-05-22 Kaspar Rothenfusser