Related papers: Formal Power Series on Algebraic Cryptanalysis

It was experimentally observed that the majority of real-world networks follow power law degree distribution. The aim of this paper is to study the algorithmic complexity of such "typical" networks. The contribution of this work is twofold.…

In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…

The algebraic degree is an important parameter of Boolean functions used in cryptography. When a function in a large number of variables is not given explicitly in algebraic normal form, it might not be feasible to compute its degree.…

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

We solve the first-order classification problem for rings $R$ of polynomials $F[x_1, \ldots,x_n]$ and Laurent polynomials $F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ with coefficients in an infinite field $F$ or the ring of integers $\mathbb Z$,…

In analogy with the regularity lemma of Szemer\'edi, regularity lemmas for polynomials shown by Green and Tao (Contrib. Discrete Math. 2009) and by Kaufman and Lovett (FOCS 2008) modify a given collection of polynomials \calF =…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev's summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gr\"obner basis algorithms.

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

Let $f(z)={}_nF_{n-1}(\mathbf{\alpha},\mathbf{\beta})$ be the hypergeometric series with parameters $\mathbf{\alpha} = (\alpha_1,\ldots,\alpha_n)$ and $\mathbf{\beta} = (\beta_1,\ldots,\beta_{n-1},1)$ in $(\mathbb{Q}\cap(0,1])^n$, let…

Let $S$ be a polynomial ring in $n$ variables over a field. Let $I$ be a homogeneous ideal in $S$ generated by forms of degree at most $d$ with $\text{dim}(S/I)=r$. In the first part of this paper, we show how to derive from a result of Hoa…

We provide an algorithm which decides whether a polynomial foliation $\mathcal{F}^{\mathbb{C}^2}$ on the complex plane has a polynomial first integral of genus $g\neq 1$. Except in a specific case, an extension of the algorithm also decides…

The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…

We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…

In this paper, we analyze the algebraic invariants for two classes of multivariate quadratic systems: systems made by OV quadratic polynomials and systems made by both OV polynomials and fully quadratic ones. For such systems, we explicitly…

In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Groebner bases…

Nowadays, the notion of semi-regular sequences, originally proposed by Fr\"oberg, becomes very important not only in Mathematics, but also in Information Science, in particular Cryptology. For example, it is highly expected that randomly…

We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal…