中文
相关论文

相关论文: The monic integer transfinite diameter

200 篇论文

Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…

数论 · 数学 2022-01-27 Maxwell Forst , Lenny Fukshansky

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at…

最优化与控制 · 数学 2010-10-07 Gennadiy Averkov , Robert Weismantel

An occurrence of a consecutive permutation pattern $p$ in a permutation $\pi$ is a segment of consecutive letters of $\pi$ whose values appear in the same order of size as the letters in $p$. The set of all permutations forms a poset with…

组合数学 · 数学 2011-03-02 Antonio Bernini , Luca Ferrari , Einar Steingrimsson

Let $F$ be a non-zero polynomial with integer coefficients in $N$ variables of degree $M$. We prove the existence of an integral point of small height at which $F$ does not vanish. Our basic bound depends on $N$ and $M$ only. We separately…

数论 · 数学 2007-06-26 Lenny Fukshansky

A sequence $(e_i)_{i \le m}$ of nonnegative integers $e_i$, where $m \in \mathbb{N}$ or $m =\infty$, is called a binomid index if $\sum_{i=n-k+1}^{n} e_i\geq \sum_{i=1}^ke_i$ for all $k, n \in \mathbb{N}$ such that $ 1\le k \le n < m$.…

组合数学 · 数学 2025-05-27 Jonathan Caalim , Yu-ichi Tanaka

We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of Fq[T] of degree d for which s consecutive coefficients a_{d-1},..., a_{d-s} are fixed. Our estimate holds without restrictions on the…

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

交换代数 · 数学 2016-12-07 Anuj Jakhar , Neeraj Sangwan

In this paper we examine the subset of Farey fractions of order Q consisting of those fractions whose denominators are odd. In particular, we consider the frequencies of values of numerators of differences of consecutive elements in this…

数论 · 数学 2009-07-14 Alan K. Haynes

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

数论 · 数学 2019-05-07 Pablo Sáez , Xavier Vidaux , Maxim Vsemirnov

The Lyubeznik size of a monomial ideal $I$ of a polynomial ring $S$ is a lower bound for the Stanley depth of $I$ decreased by $1$. A proof given by Herzog-Popescu-Vladoiu had a gap which is solved here.

交换代数 · 数学 2016-06-10 Dorin Popescu

A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set $\mathbb{I}$ of intervals and we want to find an independent subset of intervals of largest cardinality. Let…

数据结构与算法 · 计算机科学 2015-02-05 Sergio Cabello , Pablo Pérez-Lantero

The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…

组合数学 · 数学 2014-04-03 Jason P Smith

Let S be a polynomial ring in n variables over a field, and let M be a monomial ideal of S. We introduce a new invariant, called the order of dominance of S/M, denoted odom(S/M), which has many similarities with the codimension of S/M. We…

交换代数 · 数学 2019-08-12 Guillermo Alesandroni

We show that there exists a sequence $\{n_k, k\ge 1\}$ growing at least geometrically such that for any finite non-negative measure $\nu$ such that $\hat \nu\ge 0$, any $T>0$, $$ \int_{-2^{n_k} T}^{2^{n_k} T} \hat \nu(x) \dd x \ll_\e…

泛函分析 · 数学 2017-07-20 Michel Weber

An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i \in 2..n, i \le i+y[i] \le n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater…

离散数学 · 计算机科学 2014-06-13 Manolis Christodoulakis , P. J. Ryan , W. F. Smyth , Shu Wang

We elucidate why an interval algorithm that computes the exact bounds on the amplitude and phase of the discrete Fourier transform can run in polynomial time. We address this question from a formal perspective to provide the mathematical…

数值分析 · 数学 2022-05-30 Marco de Angelis

This short note shows a limiting behavior of integrals of some centered antipersistent stationary infinitely divisible moving averages as the compact integration domain in $d\ge 1$ dimensions extends to the whole positive quadrant…

概率论 · 数学 2024-07-10 Evgeny Spodarev

We focus on the problem estimating a monotone trend function under additive and dependent noise. New point-wise confidence interval estimators under both short- and long-range dependent errors are introduced and studied. These intervals are…

统计理论 · 数学 2016-02-23 Pramita Bagchi , Moulinath Banerjee , Stilian Stoev

Rabinovitch showed in 1978 that the interval orders having a representation consisting of only closed unit intervals have order dimension at most 3. This article shows that the same dimension bound applies to two other classes of posets:…

组合数学 · 数学 2022-01-05 Mitchel T. Keller , Ann N. Trenk , Stephen J. Young

In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…

组合数学 · 数学 2024-11-13 Csaba Biro , Sida Wan