Related papers: Covering a supermodular-like function in a mixed h…

The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…

It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been studied as well. One way to prove unimodality is to prove…

We consider an arbitrary polynomial map $f:{\mathbb C}^{n+1}\to {\mathbb C} $ and we study the Alexander invariants of ${\mathbb C}^{n+1}\setminus X$ for any fiber $X$ of $f$. The article has two major messages. First, the most important…

Generalizing the well-known Shafarevich hyperbolicity conjecture, it has been conjectured by Viehweg that a quasi-projective manifold that admits a generically finite morphism to the moduli stack of canonically polarized varieties is…

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

We prove a mixed version of a conjecture of Griffiths: that the closure of the image of any admissible mixed period map is quasiprojective, with a natural ample bundle. Specifically, we consider the map from the image of the mixed period…

Let $\mathcal{H}=(X,\mathcal{E})$ be a hypergraph. A support is a graph $Q$ on $X$ such that for each $E\in\mathcal{E}$, the subgraph of $Q$ induced on the elements in $E$ is connected. In this paper, we consider hypergraphs defined on a…

In this paper we introduce a unifying approach to the generalized Tur\'an problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m, G)$ is the least number of copies of a subgraph $G$ an…

We show that the relation between multiplier ideals and $V$-filtration on the structure sheaf due to Budur-Musta\c{t}\u{a}-Saito generalizes to singular irreducible varieties, by replacing multiplier ideals with multiplier modules and the…

This paper is the second part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…

We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in hypergraphs in the LOCAL model. A maximal matching of a hypergraph $H=(V_H,E_H)$ is a maximal disjoint set $M\subseteq E_H$ of hyperedges and…

We consider deletion problems in graphs and supermodular functions where the goal is to reduce density. In Graph Density Deletion (GraphDD), we are given a graph $G=(V,E)$ with non-negative vertex costs and a non-negative parameter $\rho…

The aim of this paper is to study the intersection hypergraph $\tilde{\Gamma}_\mathcal{H}(\mathbb{Z}_n)$ and co-maximal hypergraph $Co_\mathcal{H}(\mathbb{Z}_n)$ on the subgroups of $\mathbb{Z}_n$. We prove that the intersection and…

We prove a weak version of a conjecture of Matsushita saying that for a Lagrangian fibration on a hyper-Kaehler manifold $X$, the moduli map for the fibers is either generically of maximal rank or constant. Assuming the base is smooth and…

We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…

For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{v_{i}}$ (or $d_{i}$ for short) the degree of vertex $v_{i}$. The $p$-Sombor matrix $\textbf{S}_{\textbf{p}}(G)$ ($p\neq0$) of a graph $G$ is a square matrix, where the $(i,j)$-entry is…

A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…