相关论文: Construction Techniques for Linear Realizations of…

We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be…

A $(v,k,\lambda)$-covering is a pair $(V, \mathcal{B})$, where $V$ is a $v$-set of points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least…

Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…

Satisfiability Modulo Theories (SMT) solvers check the satisfiability of quantifier-free first-order logic formulas. We consider the theory of non-linear real arithmetic where the formulae are logical combinations of polynomial constraints.…

Let $X$ be either a general hypersurface of degree $n+1$ in $\mathbb P^n$ or a general $(2,n)$ complete intersection in $\mathbb P^{n+1}, n\geq 4$. We construct balanced rational curves on $X$ of all high enough degrees. If $n=3$ or $g=1$,…

We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due…

Let $X$ be a complete $n$-dimensional simplicial toric variety with homogeneous coordinate ring $S$. We study the multigraded Hilbert function $H_Y$ of reduced $0$-dimensional subschemes $Y$ in $X$. We provide explicit formulas and prove…

In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…

A multiset $\Lambda=\{\lambda_1,\ldots,\lambda_n\}$ of complex numbers is said to be realizable whenever there exists a nonnegative matrix of order $n$ with spectrum $\Lambda$. One of the broadest criterion that guarantees realizability is…

Finding the Lie-algebraic closure of a handful of matrices has important applications in quantum computing and quantum control. For most realistic cases, the closure cannot be determined analytically, necessitating an explicit numerical…

We study the \emph{Bipartite Degree Realization} (BDR) problem: given a graphic degree sequence $D$, decide whether it admits a realization as a bipartite graph. While bipartite realizability for a fixed vertex partition can be decided in…

For any $k\ge 3$ and $\ell \in [k-1]$ such that $(k,\ell) \ne (3,1)$, we show that any sufficiently large $k$-graph $G$ must contain a Hamilton $\ell$-cycle provided that it has no isolated vertices and every set of $k-1$ vertices contained…

In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations…

We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…

In this paper, we prove the following. First, every square matrix whose entries are multivariable rational functions over a field $\mathbb{F}$ has a Bessmertny\u{i} realization, i.e., is the Schur complement of an affine linear square…

The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…

Let $G$ be a finite simple graph, and $J_G$ denote the binomial edge ideal of $G$. In this article, we first compute the $\mathrm{v}$-number of binomial edge ideals corresponding to Cohen-Macaulay closed graphs. As a consequence, we obtain…

We study the problems of consistency and of the existence of finite-dimensional realizations for multi-curve interest rate models of Heath-Jarrow-Morton type, generalizing the geometric approach developed by T. Bj\"ork and co-authors in the…

The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or multiple edges) such that each vertex $v_i$ has degree $a_i.$ Given pairs of nonnegative integers…

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…