Related papers: Quasi-polynomial Hitting-set for Set-depth-Delta F…

By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…

Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…

Let $X$ be a proper CAT($0$) space and $G$ a cocompact group of isometries of $X$ without fixed point at infinity. We prove that if $\partial X$ contains an invariant subset of circumradius $\pi/2$, then $X$ contains a quasi-dense, closed…

We consider the problem of enumerating all minimal transversals (also called minimal hitting sets) of a hypergraph $\mathcal{H}$. An equivalent formulation of this problem known as the \emph{transversal hypergraph} problem (or…

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

In this contribution we consider the sequence $\{Q_{n}^{\lambda}\}_{n\geq 0} $ of monic polynomials orthogonal with respect to the following inner product involving differences \begin{equation*} \langle p,q\rangle…

The aim of this paper is to introduce a method for computing Hilbert decompositions (and consequently the Hilbert depth) of a finitely generated multigraded module $M$ over the polynomial ring $K[X_1,..., X_n]$ by reducing the problem to…

For a simplicial complex $\Delta$, the graded Betti number $\beta_{i,j}(k[\Delta])$ of the Stanley-Reisner ring $k[\Delta]$ over a field $k$ has a combinatorial interpretation due to Hochster. Terai and Hibi showed that if $\Delta$ is the…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices…

A new numerical method is introduced for calculation of quasi-polynomial zeros with constant single delay. The trajectories of zeros are obtained depending on time-delay from zero to final time-delay value. The method determines all the…

We introduce the concept of $\delta$-sequence. A $\delta$-sequence $\Delta$ generates a well-ordered semigroup $S$ in $\mathbb{Z}^2$ or $\mathbb{R}$. We show how to construct (and compute parameters) for the dual code of any evaluation code…

We compute the special values of partial zeta function at $s=0$ for family of real quadratic fields $K_n$ and ray class ideals $\fb_n$ such that $\fb_n^{-1} = [1,\delta(n)]$ where the continued fraction expansion of $\delta(n)$ is purely…

We investigate a class of non-quasi-homogeneous free divisors in the sense of Saito. These divisors are defined by equations of the form $D:= \{h=0\}$ on $\mathbb{C}^p$, where the polynomial $h$ is specific linear combination of monomials…

In this paper we study the complexity of constructing a hitting set for the closure of VP, the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomial sized algebraic circuits, over the…

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

The approximate degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that approximates $f$ pointwise: $|f(x)-p(x)|\leq1/3$ for all $x\in\{0,1\}^n.$ For every $\delta>0,$ we construct CNF…

We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…

To determine the Hilbert space and inner product for a quantum theory defined by a non-Hermitian $\mathcal{PT}$-symmetric Hamiltonian $H$, it is necessary to construct a new time-independent observable operator called $C$. It has recently…

We investigate the problem of synthesizing T-depth optimal quantum circuits over the Clifford+T gate set. First we construct a special subset of T-depth 1 unitaries, such that it is possible to express the T-depth-optimal decomposition of…