相关论文: On the non-very generic intersections in discrimin…

We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…

We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most $t$ sets. We give an algorithm that finds a coloring with discrepancy $O((t \log n \log s)^{1/2})$ where $s$ is the…

The k-th Fitting ideal of the Alexander invariant B of an arrangement A of n complex hyperplanes defines a characteristic subvariety, V_k(A), of the complex algebraic n-torus. In the combinatorially determined case where B decomposes as a…

We perform an updated global analysis of the known and unknown parameters of the standard $3\nu$ framework as of 2025. The known oscillation parameters include three mixing angles $(\theta_{12},\,\theta_{23},\,\theta_{13})$ and two squared…

Points in the intersection of Schubert varieties are counted by various combinatorial objects, for example standard tableaux. This paper consider the problem of producing a natural labelling of intersection points by these combinatorial…

One of the major open problems in noncommutative algebraic geometry is the classification of noncommutative surfaces, and this paper resolves a significant case of this problem. Specifically, let S denote the 3-dimensional Sklyanin algebra…

We introduce the notion of algebraic higher symmetry, which generalizes higher symmetry and is beyond higher group. We show that an algebraic higher symmetry in a bosonic system in $n$-dimensional space is characterized and classified by a…

In a series of recent contributions on the notion of global breadth $\mathbf{B}(G)$ of a finite group $G$, it was interesting to observe the structural conditions arising from the classification of finite groups of $\mathbf{B}(G)=8$. This…

In this paper we give a very natural description of the bijections between the minimal CW-complex homotopy equivalent to the complement of a supersolvable arrangement $\mathcal{A}$, the $\textbf{nbc}$ basis of the Orlik-Solomon algebra…

From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a…

In this paper, the third in the series, we continue our study of combinatorics in chaotic Newtonian dynamics. We study the chaotic four-body problem in Newtonian gravity assuming finite-sized particles, and we focus on interactions that…

Randomly diluted quantum boson and spin models in two dimensions combine the physics of classical percolation with the well-known dimensionality dependence of ordering in quantum lattice models. This combination is rather subtle for models…

Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…

Starting from the collisional Boltzmann equation, we derive for the first time and from first principles the Boltzmann hierarchy for neutrinos including interactions with a scalar particle. Such interactions appear, for example, in…

A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial…

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…

Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in…

We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique…

We investigate the geometry of the maximal a posteriori (MAP) partition in the Bayesian Mixture Model where the component and the base distributions are chosen from conjugate exponential families. We prove that in this case the clusters are…