相关论文: Multiplicative function instead of logarithm (an e…

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…

Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations…

In this paper, we introduce a variation of the factor complexity, called the $N$-factor complexity, which allows us to characterize the complexity of sequences on an infinite alphabet. We evaluate precisely the $N$-factor complexity for the…

The zeta function of a motive over a finite field is multiplicative with respect to the direct sum of motives. It has beautiful analytic properties, as were predicted by the Weil conjectures. There is also a multiplicative zeta function,…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

We define a new graph operator, called the weak-factor graph, which comes from the context of complex network modelling. The weak-factor operator is close to the well-known clique-graph operator but it rather operates in terms of bicliques…

We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…

Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…

We study the multiplication operators on the weighted Lipschitz space $\mathcal{L}_{\textbf{w}}$ consisting of the complex-valued functions $f$ on the set of vertices of an infinite tree $T$ rooted at $o$ such that $\sup_{v\neq…

Many applied time-dependent problems are characterized by an additive representation of the problem operator. Additive schemes are constructed using such a splitting and associated with the transition to a new time level on the basis of the…

In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set…

The well-known difficulties arising in a classification which is not set-theoretically trivial---involving what is sometimes called a non-smooth quotient---have been overcome in a striking way in the theory of operator algebras by the use…

Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…

We are used to thinking of an operator acting once, twice, and so on. However, an operator acting integer times can be consistently analytic continued to an operator acting complex times. Applications: (s,r) diagrams and an extension of…

For a complex number s, the s-order integral of function f fulfilling some conditions is defined as action of an operator, noted J^s, on f. The definition of the operator J^s is given firstly for the case of complex number s with positive…

For a smooth algebraic variety $X$, we study the category of finitely generated modules over the ring of function of $X$ that has a compatible action of the Lie algebra $\mathcal{V}$ of polynomials vector fields on $X$. We show that the…

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Mahler equations relate evaluations of the same function $f$ at iterated $b$th powers of the variable. They arise in particular in the study of automatic sequences and in the complexity analysis of divide-and-conquer algorithms. Recently,…

This paper presents an algebraic approach to characterizing higher-order differential operators. While the foundational Leibniz rule addresses first-order derivatives, its extension to higher orders typically involves identities relating…