English
Related papers

Related papers: Flag-accurate arrangements

200 papers

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Dynamical Systems · Mathematics 2020-09-14 Ville Salo

Real-world applications of machine learning tools in high-stakes domains are often regulated to be fair, in the sense that the predicted target should satisfy some quantitative notion of parity with respect to a protected attribute.…

Machine Learning · Computer Science 2022-02-07 Han Zhao , Geoffrey J. Gordon

The purpose of this work is to collect in one place available information on line arrangements known in the literature as braid, monomial, Ceva or Fermat arrangement. They have been studied for a long time and appeared recently in…

Algebraic Geometry · Mathematics 2019-09-11 Justyna Szpond

The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…

Representation Theory · Mathematics 2024-08-13 Laurent Demonet , Osamu Iyama , Nathan Reading , Idun Reiten , Hugh Thomas

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that…

Computer Science and Game Theory · Computer Science 2016-04-07 Sylvain Bouveret , Michel Lemaître

Using the classification of finite Weyl groupoids we prove that crystallographic arrangements, a large subclass of the class of simplicial arrangements which was recently defined, are hereditarily inductively free. In particular, all…

Combinatorics · Mathematics 2016-12-06 Mohamed Barakat , Michael Cuntz

Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…

Rings and Algebras · Mathematics 2016-12-06 Jan Šaroch

We present convergence theory for corrected quadrature rules on uniform Cartesian grids for functions with a point singularity. We begin by deriving an error estimate for the punctured trapezoidal rule, and then derive error expansions. We…

Numerical Analysis · Mathematics 2022-08-30 Federico Izzo , Olof Runborg , Richard Tsai

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…

Logic · Mathematics 2019-12-19 Tapani Hyttinen , Gianluca Paolini

In 1997, T. Cochran, K. Orr, and P. Teichner defined a filtration {F_n} of the classical knot concordance group C. The filtration is important because of its strong connection to the classification of topological 4-manifolds. Here we…

Geometric Topology · Mathematics 2014-11-11 Tim D. Cochran , Shelly Harvey , Constance Leidy

We characterize complete intersection matrix Schubert varieties, generalizing the classical result on one-sided ladder determinantal varieties. We also give a new proof of the F-rationality of matrix Schubert varieties. Although it is known…

Algebraic Geometry · Mathematics 2013-10-25 Jen-Chieh Hsiao

We produce a one-parameter family of hyperplane arrangements that are counterexamples to the conjecture of Saito that the complexified complement of a free arrangement is $K(\pi,1)$. These arrangements are the restriction of a one-parameter…

Algebraic Topology · Mathematics 2008-02-03 Paul H. Edelman , Victor Reiner

We introduce a proper display calculus for (non-distributive) Lattice Logic which is sound, complete, conservative, and enjoys cut-elimination and sub-formula property. Properness (i.e. closure under uniform substitution of all parametric…

Logic · Mathematics 2016-12-31 Giuseppe Greco , Alessandra Palmigiano

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio

Non notherian Formal schemes of perfectoid type (for example $\mathbb{Z}_p[p^{1/p^\infty}]\langle X^{1/p^\infty} \rangle$ along with its multivariate version) with rational degree are constructed and are shown to be admissible. These formal…

Algebraic Geometry · Mathematics 2019-07-05 Harpreet Singh Bedi

This is the second of a series of articles devoted to the study of relaxed highest-weight modules over affine vertex algebras and W-algebras. The first studied the simple "rank-$1$" affine vertex superalgebras $L_k(\mathfrak{sl}_2)$ and…

Representation Theory · Mathematics 2021-02-16 Kazuya Kawasetsu , David Ridout

We build a new perspective to count perfect matchings of a given graph. This idea is motivated by a construction on the relative cohomology group of surfaces. As an application of our theory, we reprove the celebrated Aztec Diamond theorem,…

Combinatorics · Mathematics 2024-08-21 Pravakar Paul , Manjil P. Saikia

In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…

Rings and Algebras · Mathematics 2026-03-12 Theophilus Agama , Gael Kibiti

Given an integer $k$ and a graph where every edge is colored either red or blue, the goal of the exact matching problem is to find a perfect matching with the property that exactly $k$ of its edges are red. Soon after Papadimitriou and…

Data Structures and Algorithms · Computer Science 2023-10-02 Nicolas {El Maalouly} , Raphael Steiner , Lasse Wulf