Related papers: Limit-Cycle Replication via Chebyshev Pullbacks an…
An $(n,r,h,a,q)$-Local Reconstruction Code (LRC) is a linear code over $\mathbb{F}_q$ of length $n$, whose codeword symbols are partitioned into $n/r$ local groups each of size $r$. Each local group satisfies `$a$' local parity checks to…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
We propose a Recursive Polynomial Generic Construction (RPGC) of multiplication algorithms in any finite field $\mathbb{F}_{q^n}$ based on the method of D.V. and G.V. Chudnovsky specialized on the projective line. They are usual polynomial…
Classical circuit complexity characterizes parallel computation in purely combinatorial terms, ignoring the physical constraints that govern real hardware. The standard classes $\mathbf{NC}$, $\mathbf{AC}$, and $\mathbf{TC}$ treat unlimited…
Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex…
The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…
The purpose of the present paper is to study the limit cycles of one-parameter perturbed plane Hamiltonian vector field $X_\varepsilon$ $$ X_\varepsilon : \left\{ \begin{array}{llr} \dot{x}=\;\; H_y+\varepsilon f(x,y)\\…
We study the number and distribution of the limit cycles of a planar vector field whose component functions are random polynomials. We prove a lower bound on the average number of limit cycles when the random polynomials are sampled from…
For a planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal P}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In this paper, we prove that $\operatorname{\mathbf{N}}_{\mathcal P}(n,P_7)\sim{4\over…
We formalize a framework of algebraically natural lower bounds for algebraic circuits. Just as with the natural proofs notion of Razborov and Rudich for boolean circuit lower bounds, our notion of algebraically natural lower bounds captures…
In this paper, the author constructs a family of algebraic cycles in Bloch's cubical cycle complex over the projective line minus three points which are expected to correspond to multiple polylogarithms in one variable. Elements in this…
We study ultrametric germs in one variable having an irrationally indifferent fixed point at the origin with a prescribed multiplier. We show that for many values of the multiplier, the cycles in the unit disk of the corresponding monic…
In this work we revisit and extend the method introduced by Lins Neto, Sad and Sc\'{a}rdua for detecting the non-existence of invariant algebraic curves other than some prescribed invariant nodal curve. We prove that, under the existence of…
Some PARI programs have bringed out a property for the non-genus part of the class number of the imaginary quadratic fields, with respect to $(\sqrt D\,)^{\varepsilon}$, where $D$ is the absolute value of the discriminant and $\varepsilon…
We consider the 1-parameter family of planar quintic systems, $\dot x= y^3-x^3$, $\dot y= -x+my^5$, introduced by A. Bacciotti in 1985. It is known that it has at most one limit cycle and that it can exist only when the parameter $m$ is in…
In the context of reconstructing phylogenetic networks from a collection of phylogenetic trees, several characterisations and subsequently algorithms have been established to reconstruct a phylogenetic network that collectively embeds all…
When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…
In order to formally understand the power of neural computing, we first need to crack the frontier of threshold circuits with two and three layers, a regime that has been surprisingly intractable to analyze. We prove the first super-linear…
In this paper, we apply the averaging method via Brouwer degree in a class of planar systems given by a linear center perturbed by a sum of continuous homogeneous vector fields, to study lower bounds for their number of limit cycles. Our…
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…