Related papers: The Threshold Problem for Hypergeometric Sequences…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
The paper established sufficient conditions of predictability with degeneracy for the spectrum at $M$-periodically located isolated points on the unit circle. It is also shown that $m$-periodic subsequences of these sequences are also…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
Given a sequence of $s$-uniform hypergraphs $\{H_n\}_{n \geq 1}$, denote by $T_p(H_n)$ the number of edges in the random induced hypergraph obtained by including every vertex in $H_n$ independently with probability $p \in (0, 1)$. Recent…
We present a dichotomy theorem on the parameterized complexity of the 3-uniform hypergraphicality problem. Given $0<c_1\le c_2 < 1$, the parameterized 3-uniform Hypergraphic Degree Sequence problem, $3uni-HDS_{c_1,c_2}$, considers degree…
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental reachability problem for continuous linear dynamical systems,…
We consider a self-convolutive recurrence whose solution is the sequence of coefficients in the asymptotic expansion of the logarithmic derivative of the confluent hypergeometic function $U(a,b,z)$. By application of the Hilbert transform…
We define the generalized hypergeometric polynomial of degree N in terms of the generalized hypergeometric function that depends on p parameters a_1, ..., a_p and q parameters b_1, ..., b_q. The parameters are "generic", possibly complex,…
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…
The sequential allocation protocol is a simple and popular mechanism to allocate indivisible goods, in which the agents take turns to pick the items according to a predefined sequence. While this protocol is not strategy-proof, it has been…
For $a,b,c,z,p, \theta \in \mathbb{C}$, where $\mathbb{C}$ is the complex plane, $-c\notin \mathbb{N\cup }\left\{ 0\right\} $, let \begin{equation*} \mathcal{M}\left( z\right) =\left( 1-\theta z\right) ^{p}M\left(a;c;z\right)…
A resolving set $S$ of a graph $G$ is a subset of its vertices such that no two vertices of $G$ have the same distance vector to $S$. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a…
We prove the following theorems: 1) The Laurent expansions in epsilon of the Gauss hypergeometric functions 2F1(I_1+a*epsilon, I_2+b*epsilon; I_3+p/q + c epsilon; z), 2F1(I_1+p/q+a*epsilon, I_2+p/q+b*epsilon; I_3+ p/q+c*epsilon;z),…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…
The uniform quadratic optimizatin problem (UQ) is a nonconvex quadratic constrained quadratic programming (QCQP) sharing the same Hessian matrix. Based on the second-order cone programming (SOCP) relaxation, we establish a new sufficient…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
In the Hedge Cut problem, the edges of a graph are partitioned into groups called hedges, and the question is what is the minimum number of hedges to delete to disconnect the graph. Ghaffari, Karger, and Panigrahi [SODA 2017] showed that…
We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…