相关论文: On Circuit Diameter Bounds via Circuit Imbalances
Lienard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Lienard systems of arbitrary degree on the plane, and develop a new method to obtain a…
In 1954, G. Polya conjectured that the counting function $N(\Omega,\Lambda)$ of the eigenvalues of the Laplace operator of the Dirichlet (resp. Neumann) boundary value problem in a bounded set $\Omega\subset R^d$ is lesser (resp. greater)…
We study the maximum size of a subset of the $n \times n$ integer grid that does not contain specific geometric configurations, a variation of the classical problems initiated by Erd\H{o}s and Purdy. While extremal problems for 3-point…
We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…
We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…
We derive bounds on the number of switches at an arbitrary set of positions in a circular sequence of permutations and relate them to the diameter of Multipermutohedra.
Imposing either Dirichlet or Neumann boundary conditions on the boundary of a smooth bounded domain $\Omega$, we study the perturbation incurred by the voltage potential when the conductivity is modified in a set of small measure. We…
The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that…
We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…
In this article, we consider the (double) minimization problem $$\min\left\{P(E;\Omega)+\lambda W_p(E,F):~E\subseteq\Omega,~F\subseteq \mathbb{R}^d,~\lvert E\cap F\rvert=0,~ \lvert E\rvert=\lvert F\rvert=1\right\},$$ where $p\geqslant 1$,…
Reversible circuits have been studied extensively and intensively, and have plenty of applications in various areas, such as digital signal processing, cryptography, and especially quantum computing. In 2003, the lower bound $\Omega(2^n…
First, we obtain a new formula for Bremermann type upper envelopes, that arise frequently in convex analysis and pluripotential theory, in terms of the Legendre transform of the convex- or plurisubharmonic-envelope of the boundary data.…
We develop a framework for algorithms finding the diameter in graphs of bounded distance Vapnik-Chervonenkis dimension, in (parameterized) subquadratic time complexity. The class of bounded distance VC-dimension graphs is wide, including,…
Let $x'=S(t,x)$ be a differential equation in the cylinder, linear piecewise in $x$ and with trigonometric coefficients in $t$. In this paper, we provide an upper bound on the number of limit cycles in terms of the number of regions of the…
In this paper we prove that the shape optimization problem $$\min\left\{\lambda_k(\Omega):\ \Omega\subset\R^d,\ \Omega\ \hbox{open},\ P(\Omega)=1,\ |\Omega|<+\infty\right\},$$ has a solution for any $k\in\N$ and dimension $d$. Moreover,…
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…
We show that any quantum circuit of treewidth $t$, built from $r$-qubit gates, requires at least $\Omega(\frac{n^{2}}{2^{O(r\cdot t)}\cdot \log^4 n})$ gates to compute the element distinctness function. Our result generalizes a…
We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates $C_{\delta}(U)$ to approximate a unitary $U$ up to an error of $\delta$ in operator norm distance. More precisely we show two bounds…
Considering Limit Cycles as one of the limits of Lienard equation, an analyis analogous to centre manifold analysis has been done for a $3-D$ nonlinear system exhibiting Limit Cycle. A rigorous study on radius of the Limit Cycle orbit has…
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…