Related papers: A general framework for Noetherian well ordered po…
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…
It is well known that in the Noetherian local ring with infinite residue field the reduction of $\mm$-primary ideal may be given in the form of a sufficiently general linear combination of its generators. In the paper we give a condition…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…
Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
Coherently with the principle of analogy suggested by Dirac, we describe a general setting for reducing a classical dynamics, and the role of the Noether theorem -- connecting symmetries with constants of the motion -- within a reduction.…
The \emph{Noetherian class} is a wide class of functions defined in terms of polynomial partial differential equations. It includes functions appearing naturally in various branches of mathematics (exponential, elliptic, modular, etc.). A…
Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented…
Those lectures revolve around the following problem: given a system of n real polynomials in n variables, count the number of real roots. The first lecture is a course on Newton iteration and alpha-theory. The second describes an…
The coprimary filtration is a basic construction in commutative algebra. In this article, we prove the existence and uniqueness of coprimary filtration of modules (not necessarily finitely generated) over a Noetherian ring. Moreover, we…
Lie symmetry analysis is an established method for generating symmetries of differential equations. We apply this method together the generalized fundamental theorem of double reduction. In particular, Noether symmetries and some associated…
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…
In this paper, we study an unconventional but practically meaningful reversibility problem of commonly used image filters. We broadly define filters as operations to smooth images or to produce layers via global or local algorithms. And we…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
This survey article has two components. The first part gives a gentle introduction to Serre's notion of $G$-complete reducibility, where $G$ is a connected reductive algebraic group defined over an algebraically closed field. The second…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…
Let $R$ be a standard graded Noetherian algebra over an infinite field $K$ and $M$ a finitely generated $\mathbb{Z}$-graded $R$-module. Then for any graded ideal $I\subseteq R_+$ of $R$, we show that there exist integers $e_1\geq e_2$ such…
Algorithmic efficiency is essential to reducing energy and time usage for computational problems. Optimizing efficiency is important for tasks involving multiple resources, for example in stochastic calculations where the size of the random…