惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

量子位
I
InfoQ
人人都是产品经理
人人都是产品经理
博客园 - 三生石上(FineUI控件)
爱范儿
爱范儿
Hugging Face - Blog
Hugging Face - Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
S
SegmentFault 最新的问题
美团技术团队
小众软件
小众软件
Blog — PlanetScale
Blog — PlanetScale
Jina AI
Jina AI
aimingoo的专栏
aimingoo的专栏
H
Help Net Security
Last Week in AI
Last Week in AI
博客园_首页
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
L
LangChain Blog
云风的 BLOG
云风的 BLOG
Martin Fowler
Martin Fowler
宝玉的分享
宝玉的分享
G
Google Developers Blog
博客园 - 叶小钗
博客园 - Franky

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
On the $t$-adic Littlewood Conjecture
Faustin Adiceam, Erez Nesharim, Fred Lunnon · 2018-06-12 · via math.CO updates on arXiv.org

The $p$-adic Littlewood Conjecture due to De Mathan and Teulié asserts that for any prime number $p$ and any real number $α$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle mα\rangle|\, =\, 0 $$ holds. Here, $|m|$ is the usual absolute value of the integer $m$, $|m|_p$ its $p$-adic absolute value and $ |\langle x\rangle|$ denotes the distance from a real number $x$ to the set of integers. This still open conjecture stands as a variant of the well-known Littlewood Conjecture. In the same way as the latter, it admits a natural counterpart over the field of formal Laurent series $\mathbb{K}\left(\left(t^{-1}\right)\right)$ of a ground field $\mathbb{K}$. This is the so-called \emph{$t$-adic Littlewood Conjecture} ($t$-LC). It is known that $t$--LC fails when the ground field $\mathbb{K}$ is infinite. This article is concerned with the much more difficult case when the latter field is finite. More precisely, a \emph{fully explicit} counterexample is provided to show that $t$-LC does not hold in the case that $\mathbb{K}$ is a finite field with characteristic 3. Generalizations to fields with characteristics different from 3 are also discussed. The proof is computer assisted. It reduces to showing that an infinite matrix encoding Hankel determinants of the Paper-Folding sequence over $\mathbb{F}_3$, the so-called Number Wall of this sequence, can be obtained as a two-dimensional automatic tiling satisfying a finite number of suitable local constraints.