相关论文: The $cd$-index of base polytopes for connected spl…

If $\mathcal{C}$ is a minor-closed class of matroids, the class $\mathcal{C}'$ of integer polymatroids whose natural matroids are in $\mathcal{C}$ is also minor closed, as is the class $\mathcal{C}'_k$ of $k$-polymatroids in $\mathcal{C}'$.…

We prove that the ranks of the subsets and the activities of the bases of a matroid define valuations for the subdivisions of a matroid polytope into smaller matroid polytopes.

We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as…

For a complex polynomial $P$ of degree $n$ and an $m$-tuple of distinct complex numbers $\Lambda=(\lambda_1,\ldots,\lambda_m)$, the dope matrix $D_P(\Lambda)$ is defined as the $m \times (n+1)$ matrix $(c)_{ij}$ with $c_{ij} =1$ if…

In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…

Given an exact category $\mathcal{C}$, it is well known that the connected component reflector $\pi_0\colon\mathsf{Gpd}(\mathcal{C})\to\mathcal{C}$ from the category $\mathsf{Gpd}(\mathcal{C})$ of internal groupoids in $\mathcal{C}$ to the…

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

A set $\mathcal{S}$ of points in $\mathbb{R}^n$ is called a rationally parameterisable hypersurface if $\mathcal{S}=\{\boldsymbol{\sigma}(\mathbf{t}): \mathbf{t} \in D\}$, where $\boldsymbol{\sigma}: \mathbb{R}^{n-1} \rightarrow…

We prove that there is no polynomial $p(\cdot)$ with the property that a matroid $M$ can be determined to be either a lifted-graphic or frame matroid using at most $p(|M|)$ rank evaluations. This resolves two conjectures of Geelen, Gerards…

We present an extension of several results on pairs and varieties to foliated surface pairs. We prove the boundedness of local complements, the local index theorem, and the uniform boundedness of minimal log discrepancies (mlds), as well as…

We provide a formula for the Ehrhart polynomial of the connected matroid of size $n$ and rank $k$ with the least number of bases, also known as a minimal matroid. We prove that their polytopes are Ehrhart positive and $h^*$-real-rooted (and…

We consider the relationship between a matroidal analogue of the degree $a$ Cayley-Bacharach property (finite sets of points failing to impose independent conditions on degree $a$ hypersurfaces) and geometric properties of matroids. If the…

We study two-step flag positroids $(P_1, P_2)$, where $P_1$ is a quotient of $P_{2}$. We provide a complete characterization of all two-step flag positroids that contain a uniform matroid, extending and completing a partial result by…

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Face Morphing Attack Detection (MAD) is a critical challenge in face recognition security, where attackers can fool systems by interpolating the identity information of two or more individuals into a single face image, resulting in samples…

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

We describe the discrete Fourier transform (DFT) for a cyclic group when $p|N$ by factoring $x^N-1$ over finite fields and constructing the Fourier transform and its inverse using B\'{e}zout's identity for polynomials. For the symmetric…