English
Related papers

Related papers: Accurate Arrangements

200 papers

In 2002, it was conjectured that a free divisor satisfying the so-called Logarithmic Comparison Theorem (LCT) must be strongly Euler-homogeneous. Today, it is known to be true only in ambient dimension less or equal than three or assuming…

Algebraic Geometry · Mathematics 2025-12-10 Abraham del Valle Rodríguez

Given vectors $v_1,\dots,v_n\in\mathbb{R}^d$ and a matroid $M=([n],I)$, we study the problem of finding a basis $S$ of $M$ such that $\det(\sum_{i \in S}v_i v_i^\top)$ is maximized. This problem appears in a diverse set of areas such as…

Data Structures and Algorithms · Computer Science 2020-04-20 Vivek Madan , Aleksandar Nikolov , Mohit Singh , Uthaipon Tantipongpipat

Given a set $A$ of positive integers $a_1<\cdots<a_k$ and a partition $P: n_1+\cdots+n_k=n$, find the extremal denominators of the regular and semi-regular continued fraction $[0;x_1,\ldots,x_n]$ with partial quotients $x_i\in A$ and where…

Combinatorics · Mathematics 2023-02-14 Alessandro De Luca , Marcia Edson , Luca Q. Zamboni

Let $G$ be a semisimple Lie group without compact factor and $\Gamma < G$ a torsion-free, cocompact, irreducible lattice. According to Selberg, periodic orbits of regular Weyl chamber flows live on maximal flat periodic tori of the space of…

Dynamical Systems · Mathematics 2022-02-18 Nguyen-Thi Dang , Jialun Li

Let $\mathbb{Z}^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of $\mathbb{Z}^{+}$ such that neither of them contains $k + 1$ pairwise coprime integers and $C_k(n)=C_k\cap \{1,2,\ldots,n\}$. Let $f(n, k) =…

Number Theory · Mathematics 2017-05-17 Sándor Z. Kiss , Csaba Sándor , Quan-Hui Yang

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Combinatorics · Mathematics 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

Using the invariant theory of arc spaces, we find minimal strong generating sets for certain cosets of affine vertex algebras inside free field algebras that are related to classical Howe duality. These results have several applications.…

Quantum Algebra · Mathematics 2023-05-17 Andrew R. Linshaw , Bailin Song

We consider fair division of a set of indivisible goods among $n$ agents with additive valuations using the fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an agent finds an allocation fair to…

Computer Science and Game Theory · Computer Science 2024-02-19 Hannaneh Akrami , Jugal Garg , Eklavya Sharma , Setareh Taki

A seminal result of Koml\'os, S\'ark\"ozy, and Szemer\'edi states that any n-vertex graph G with minimum degree at least (1/2 + {\alpha})n contains every n-vertex tree T of bounded degree. Recently, Pham, Sah, Sawhney, and Simkin extended…

Combinatorics · Mathematics 2024-09-11 Paul Bastide , Clément Legrand-Duchesne , Alp Müyesser

The question of when a vertex algebra is a quantization of the arc space of its associated scheme has recently received a lot of attention in both the mathematics and physics literature. This property was first studied by Tomoyuki Arakawa…

Quantum Algebra · Mathematics 2024-08-13 Thomas Creutzig , Andrew R. Linshaw , Bailin Song

We attach to every Coxeter system (W,S) an extension C_W of the corresponding Iwahori-Hecke algebra. We construct a 1-parameter family of (generically surjective) morphisms from the group algebra of the corresponding Artin group onto C_W.…

Representation Theory · Mathematics 2017-01-16 Ivan Marin

A hyperplane arrangement is called formal provided all linear dependencies among the defining forms of the hyperplanes are generated by ones corresponding to intersections of codimension two. The significance of this notion stems from the…

Combinatorics · Mathematics 2024-07-03 Tilman Möller , Paul Mücksch , Gerhard Roehrle

Let $V$ be an $\ell$-dimensional Euclidean space. Let $G \subset O(V)$ be a finite irreducible orthogonal reflection group. Let ${\cal A}$ be the corresponding Coxeter arrangement. Let $S$ be the algebra of polynomial functions on $V.$ For…

Combinatorics · Mathematics 2015-07-21 Hiroaki Terao

Let $G$ be a matroid on ground set \A. The Orlik-Solomon algebra $A(G)$ is the quotient of the exterior algebra \E on \A by the ideal \I generated by circuit boundaries. The quadratic closure $\bar{A}(G)$ of $A(G)$ is the quotient of \E by…

Combinatorics · Mathematics 2007-05-23 Michael Falk

We study a generalized version of Terao's famous addition theorem for free arrangements to the category of those with projective dimension one. Namely, we give a criterion to determine the algebraic structure of logarithmic derivation…

Combinatorics · Mathematics 2022-07-20 Takuro Abe

Unbounded entailment relations, introduced by Paul Lorenzen (1951), are a slight variant of a notion which plays a fundamental r\^ole in logic (see Scott 1974) and in algebra (see Lombardi and Quitt\'e 2015). We call systems of ideals their…

Logic · Mathematics 2018-10-29 Thierry Coquand , Henri Lombardi , Stefan Neuwirth

In this article we construct a combinatorial quasi-free differential graded model for the Orlik-Solomon algebra of supersolvable matroids, which generalizes in a matroidal setting the cdga of admissible graphs introduced by M. Kontsevich…

Combinatorics · Mathematics 2025-06-19 Basile Coron

F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…

Combinatorics · Mathematics 2019-04-15 Attila Joó

We study Stanley-Reisner ideals of broken circuits complexes and characterize those ones admitting a linear resolution or being complete intersections. These results will then be used to characterize arrangements whose Orlik-Terao ideal has…

Commutative Algebra · Mathematics 2021-05-18 Le Van Dinh , Tim Roemer

The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…

Computational Complexity · Computer Science 2025-02-05 Tomáš Nagy , Michael Pinsker , Michał Wrona