Related papers: Multidimensional polynomial patterns over finite f…

We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…

In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least…

Multilinear varieties, defined as the sets of rational points of varieties cut out by multilinear functions, were first introduced and studied by Gowers and Mili\'{c}evi\'{c}[Proc. Edinb. Math. Soc., 2021] for finite $\mathbb{K}$. In this…

This paper is concerned with the problem of stochastic control of gene regulatory networks (GRNs) observed indirectly through noisy measurements and with uncertainty in the intervention inputs. The partial observability of the gene states…

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

This paper extends backstepping to higher-dimensional PDEs by leveraging domain symmetries and structural properties. We systematically address three increasingly complex scenarios. First, for rectangular domains, we characterize boundary…

The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…

We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…

Introducing inequality constraints in Gaussian process (GP) models can lead to more realistic uncertainties in learning a great variety of real-world problems. We consider the finite-dimensional Gaussian approach from Maatouk and Bay (2017)…

We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…

This paper details a methodology to transcribe an optimal control problem into a nonlinear program for generation of the trajectories that optimize a given functional by approximating only the highest order derivatives of a given system's…

We develop a mathematically rigorous framework for multilayer neural networks in the mean field regime. As the network's widths increase, the network's learning trajectory is shown to be well captured by a meaningful and dynamically…

Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…

We study the ergodic properties of a class of controlled stochastic differential equations (SDEs) driven by $\alpha$-stable processes which arise as the limiting equations of multiclass queueing models in the Halfin-Whitt regime that have…

We study an optimal process control problem with multiple assignable causes. The process is initially in-control but is subject to random transition to one of multiple out-of-control states due to assignable causes. The objective is to find…

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…