Related papers: Degrees of periods
We answer an open question in the theory of transducer degrees initially posed in [3], on the structure of polynomial transducer degrees, in particular the question of what degrees, if any, lie below the degree of $n^3$. Transducer degrees…
We review the current status of dimensions, as the result of a long and controversial history that includes input from philosophy and physics. Our conclusion is that they are subjective but essential concepts which provide a kind of…
Confusion and disagreement around the notion of time is due to the fact that we often fail to recognize that we call 'time' a variety of distinct notions, only partially related to one another. Many apparently obvious properties of time are…
Attempting to create a general framework for studying new results on transcendental numbers, this paper begins with a survey on transcendental numbers and transcendence, it then presents several properties of the transcendental numbers $e$…
We discuss our work on pointwise inequalities for the gradient which are connected with the isoperimetric profile associated to a given geometry. We show how they can be used to unify certain aspects of the theory of Sobolev inequalities.…
The standard period-index conjecture for the Brauer group of a field of transcendence degree 2 over a $p$-adic field predicts that the index divides the cube of the period. Using Gabber's theory of prime-to-$\ell$ alterations and the…
Starting from any unital colored PROP $P$, we define a category $P(P)$ of shapes called $P$-propertopes. Presheaves on $P(P)$ are called $P$-propertopic sets. For $0 \leq n \leq \infty$ we define and study $n$-time categorified $P$-algebras…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…
We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…
Using Mawhin's coincidence degree theory, we obtain some new continuation theorems which are designed to have as a natural application the study of the periodic problem for cyclic feedback type systems. We also discuss some examples of…
We consider emergence from the perspective of dynamics: states of a system evolving with time. We focus on the role of a decomposition of wholes into parts, and attempt to characterize relationships between levels without reference to…
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…
The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…
The period of a curve is the smallest positive degree of Galois-invariant divisor classes. The index is the smallest positive degree of rational divisors. We construct examples of genus one curves with prescribed period and index over…
This is an introduction to $p$-adic geometry and $p$-adic analysis focusing on the theme of $p$-adic period mappings. We follow as closely as possible the development of the classical theory of complex period mappings, blending differential…
In this paper, we characterize the degree sequences excluding the degree sequence of a square in terms of forcibly chordal graphs, and we prove several related results.
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved
We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of a network with N nodes that is drawn from an…
We introduce a hierarchy of degree structures between the Medvedev and Muchnik lattices which allow varying amounts of non-uniformity. We use these structures to introduce the notion of the uniformity of a Muchnik reduction, which expresses…