English
Related papers

Related papers: On Ritt's decomposition Theorem in the case of fin…

200 papers

We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…

Number Theory · Mathematics 2014-12-11 David Goss

Recently N. Levin (Comp. Math. 127 (2001), 1--21) proved the Tate conjecture for ordinary cubic fourfolds over finite fields. In this paper we prove the Tate conjecture for self-products of ordinary cubic fourfolds. Our proof is based on…

Number Theory · Mathematics 2007-05-23 Yuri G. Zarhin

One extends P. Deligne's notion of integrality over a finite field for a $\ell$-adic sheaf on a scheme of finite type over a local field with finite residue field. One shows that this integrality notion is preserved by $Rf_!$, as it is over…

Number Theory · Mathematics 2007-05-23 Pierre Deligne , Hélène Esnault

We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…

Algebraic Geometry · Mathematics 2019-02-12 Colin Tan , Wing-Keung To

Building on work of Kuhlmann and Lisinski, we study the theory of the Hahn series field $\mathbb{F}_{q}(\!(\mathbb{Q})\!)$, over a finite field $\mathbb{F}_{q}$, equipped with the $t$-adic valuation, in a language of valued fields. We prove…

Logic · Mathematics 2026-04-30 Sylvy Anscombe , Blaise Boissonneau

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D \geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring…

Combinatorics · Mathematics 2011-07-05 Mathias Beiglböck , Henry Towsner

Let A be the integral closure of the ring of polynomials CC[t], within the field of algebraic functions in one variable. We show that A interprets the ring of integers. This contrasts with the analogue for finite fields, proved to have a…

Logic · Mathematics 2023-12-12 Taylor Dupuy , Ehud Hrushovski

We introduce a notion of harmonic chain for chain complexes over fields of positive characteristic. A list of conditions for when a Hodge decomposition theorem holds in this setting is given and we apply this theory to finite CW complexes.…

Algebraic Topology · Mathematics 2021-10-22 Michael J. Catanzaro , Brantley Vose

We prove Tchebotarev type theorems for function field extensions over various base fields: number fields, finite fields, p-adic fields, PAC fields, etc. The Tchebotarev conclusion - existence of appropriate cyclic residue extensions - also…

Number Theory · Mathematics 2013-01-10 Sara Checcoli , Pierre Dèbes

In [7, Papadima and Suciu, When does the associated graded Lie algebra of an arrangement group decompose? Comment. Math. Helv. {\bf 81:4} (2006), 859--875] it is proved that the holonomy Lie algebra of an arrangement of hyperplanes through…

Rings and Algebras · Mathematics 2020-10-27 Clas Löfwall

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

Commutative Algebra · Mathematics 2009-07-02 Joachim von zur Gathen

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…

Logic · Mathematics 2021-02-03 Amador Martin-Pizarro , Martin Ziegler

We show that every Dedekind domain $R$ lying between the polynomial rings $\mathbb Z[X]$ and $\mathbb Q[X]$ with the property that its residue fields of prime characteristic are finite fields is equal to a generalized ring of integer-valued…

Commutative Algebra · Mathematics 2023-07-26 Giulio Peruginelli

We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…

Combinatorics · Mathematics 2024-05-14 Sandra Albrechtsen , Raphael W. Jacobs , Paul Knappe , Max Pitz

We present a simple proof that finding a rank-$R$ canonical polyadic decomposition of a 3-dimensional tensor over a finite field $\mathbb{F}$ is fixed-parameter tractable with respect to $R$ and $\mathbb{F}$. We also show a nontrivial upper…

Computational Complexity · Computer Science 2024-06-18 Jason Yang

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Number Theory · Mathematics 2021-05-04 Antonia W. Bluher

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman
‹ Prev 1 4 5 6 7 8 10 Next ›