中文
相关论文

相关论文: On the length of binary forms

200 篇论文

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

交换代数 · 数学 2024-04-16 John Pawlina , Stefan Tohaneanu

Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…

组合数学 · 数学 2014-10-23 Boris Bukh , Jie Ma

Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. Then every element $a \in H$ has a factorization into irreducible elements, and the set $\mathsf L (a)$ of all possible factorization…

交换代数 · 数学 2015-05-25 Alfred Geroldinger , Wolfgang Schmid

Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\varepsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if \[ x=\sum_{i=1}^{\infty}\varepsilon_iq^{-i}. \] For any…

数论 · 数学 2014-10-27 Simon Baker , Nikita Sidorov

Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…

组合数学 · 数学 2014-10-28 Kai-Uwe Schmidt

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

数论 · 数学 2011-04-11 Lenny Jones

The ribbonlength Rib$(K)$ of a knot $K$ is the infimum of the ratio of the length of any flat knotted ribbon with core $K$ to its width. A twisted torus knot $T_{p,q;r,s}$ is obtained from the torus knot $T_{p,q}$ by twisting $r$ adjacent…

几何拓扑 · 数学 2022-08-09 Hyoungjun Kim , Sungjong No , Hyungkee Yoo

The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of…

组合数学 · 数学 2018-12-27 János Pach , László A. Székely , Csaba D. Tóth , Géza Tóth

First, we state a generalization of the minimum-distance bound for PIR codes. Then we describe a construction for linear PIR codes using packing designs and use it to construct some new 5-PIR codes. Finally, we show that no encoder (linear…

信息论 · 计算机科学 2022-09-01 Henk D. L. Hollmann , Urmas Luhaäär

Semidefinite programming (SDP) is the task of optimizing a linear function over the common solution set of finitely many linear matrix inequalities (LMIs). For the running time of SDP solvers, the maximal matrix size of these LMIs is…

最优化与控制 · 数学 2021-01-29 Claus Scheiderer

We describe the Krein extension of minimal operator associated with the expression A:=(-1)^n*d^(2n)/dx^(2n) on a finite interval (a,b) in terms of boundary conditions. All non-negative extensions of the operator A as well as extensions with…

谱理论 · 数学 2017-07-24 Yaroslav Granovskyi , Leonid Oridoroga

Given a fixed number field K, we give non-trivial lower bounds for the distance between the conjugates of any number a from K in terms of the Mahler measure M(a) of a. In the case that K is a cubic field, our bound is best possible in terms…

数论 · 数学 2023-09-19 Jan-Hendrik Evertse

A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Sigma^* -> Sigma^* is k-uniform if h(a) has length k for all a in Sigma. A morphism is cubefree if it maps cubefree words to cubefree words. We show that…

组合数学 · 数学 2009-04-14 James Currie , Narad Rampersad

This paper investigates the length of the repeating decimal part when a fraction is expressed in decimal form. First, it provides a detailed explanation of how to calculate the length of the repeating decimal when the denominator of the…

数论 · 数学 2025-07-03 Siqiong Yao , Akira Toyohara

I will show that there exist two binary words (one of length 4 and one of length 6) that play a special role in many different problems in combinatorics on words. They can therefore be considered \textit{the shortest interesting binary…

组合数学 · 数学 2025-02-06 Gabriele Fici

Let A be a subset of the real line. We study the fractal dimensions of the k-fold iterated sumsets kA, defined as kA = A+...+A (k times). We show that for any non-decreasing sequence {a_k} taking values in [0,1], there exists a compact set…

经典分析与常微分方程 · 数学 2013-03-21 Jörg Schmeling , Pablo Shmerkin

We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5.

几何拓扑 · 数学 2012-07-04 Ramin Naimi , Elena Pavelescu

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

数论 · 数学 2024-06-18 David L. Pincus , Lawrence C. Washington

A celebrated result by Hilbert says that every real nonnegative ternary quartic is a sum of three squares. We show more generally that every nonnegative quadratic form on a real projective variety $X$ of minimal degree is a sum of…

代数几何 · 数学 2017-03-07 Grigoriy Blekherman , Daniel Plaumann , Rainer Sinn , Cynthia Vinzant

By systematically translating certain integrals involving moments of the elliptic integral into $L$-values of modular forms on $\Gamma_1(4), \Gamma(4)$ and $\Gamma_1(8)$, and then utilizing relations among the critical $L$-values of…

数论 · 数学 2025-09-30 Kam Cheong Au