Related papers: Flag-accurate arrangements
The purposes of this work are (1) to show that the appropriate generalizations of the oscillator algebra permit the construction of a wide set of nonlinear coherent states in unified form; and (2) to clarify the likely contradiction between…
A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…
Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…
A fair clustering instance is given a data set $A$ in which every point is assigned some color. Colors correspond to various protected attributes such as sex, ethnicity, or age. A fair clustering is an instance where membership of points in…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
The Exact Matching problem asks whether a bipartite graph with edges colored red and blue admits a perfect matching with exactly $t$ red edges. Introduced by Papadimitriou and Yannakakis in 1982, the problem has resisted deterministic…
We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free…
Let $\mathcal A$ be a free hyperplane arrangement. In 1989, Ziegler showed that the restriction $\mathcal A"$ of $\mathcal A$ to any hyperplane endowed with the natural multiplicity $\kappa$ is then a free multiarrangement. In 2024, the…
It is shown that the description of certain class of representations of the holonomy Lie algebra associated to hyperplane arrangement $\Delta$ is essentially equivalent to the classification of $\vee$-systems associated to $\Delta.$ The…
A Weyl arrangement is the arrangement defined by the root system of a finite Weyl group. When a set of positive roots is an ideal in the root poset, we call the corresponding arrangement an ideal subarrangement. Our main theorem asserts…
Clustering is a fundamental unsupervised learning problem where a dataset is partitioned into clusters that consist of nearby points in a metric space. A recent variant, fair clustering, associates a color with each point representing its…
Across machine learning (ML) sub-disciplines, researchers make explicit mathematical assumptions in order to facilitate proof-writing. We note that, specifically in the area of fairness-accuracy trade-off optimization scholarship, similar…
Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…
We present the first examples of higher-rank lattices whose reduced $C^{*}$-algebras satisfy strict comparison, stable rank one, selflessness, uniqueness of embeddings of the Jiang--Su algebra, and allow explicit computations of the Cuntz…
We define new deformations of group algebras of Coxeter groups W and of subgroups of even elements in them, by deforming the braid relations. We show that these deformations are algebraically flat iff they are formally flat, and that this…
We study the problem of reconstructing a perfect matching $M^*$ hidden in a randomly weighted $n\times n$ bipartite graph. The edge set includes every node pair in $M^*$ and each of the $n(n-1)$ node pairs not in $M^*$ independently with…
Let $\mathbb{K}$ be a field and $A$ a Noetherian $\mathbb{K}$-algebra. In a paper of 2020, M. Albert, C. Bertone, M. Roggero and W. M. Seiler proved that, given a quasi-stable module $U \subset R^m$ with $R=\mathbb{K}[x_0,\dots,x_n]$, any…
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…