A Complex Mode Method for Wind-Induced Responses of 6-Parameter Practical Viscoelastic Damping Energy Dissipation Structures Based on the Davenport Wind Speed Spectrum北大核心CSCD

针对六参数实用黏弹性阻尼耗能结构,基于Davenport风速谱系列响应问题进行了系统的研究.首先,利用六参数黏弹性阻尼器的微分型本构关系,建立了耗能结构基于Davenport风速谱激励下的运动方程;然后,运用复模态法将耗能结构的运动方程由二阶微分方程转化为一阶方程,获得了耗能结构系统对风振激励响应的频域解和功率谱密度函数表达式;最后,利用数学恒等式,基于随机振动理论获得了耗能结构系统在Davenport风速谱激励下的响应和阻尼器受力的解析解.该文方法不仅考虑了结构系统在风振激励作用下全振型展开的结果,表达式较现有结果更为简便,效率及精度更高,且适用于非经典阻尼结构.     

Neighboring powers

In this article we discuss how close different powers of integers can be to each other. In addition we study pairs of powers of polynomials with rational coefficients which have differences of small positive degree.     

Variables separated equations: Strikingly different roles for the Branch Cycle Lemma and the finite simple group classification

Davenport’s Problem asks:What can we expect of two polynomials,over Z,with the same ranges on almost all residue class fields? This stood out among many separated variable problems posed by Davenport,Lewis and Schinzel.By bounding the degrees,but expanding the maps and variables in Davenport’s Problem,Galois stratification enhanced the separated variable theme,solving an Ax and Kochen problem from their Artin Conjecture work.Denef and Loeser applied this to add Chow motive coefficients to previously introduced zeta functions on a diophantine statement.By restricting the variables,but leaving the degrees unbounded,we found the striking distinction between Davenport’s problem over Q,solved by applying the Branch Cycle Lemma,and its generalization over any number field,solved by using the simple group classification.This encouraged Thompson to formulate the genus 0 problem on rational function monodromy groups.Guralnick and Thompson led its solution in stages.We look at two developments since the solution of Davenport’s problem.Stemming from MacCluer’s 1967 thesis,identifying a general class of problems,including Davenport’s,as monodromy precise.R(iemann)E(xistence)T(heorem)’s role as a converse to problems generalizing Davenport’s,and Schinzel’s (on reducibility).We use these to consider:Going beyond the simple group classification to handle imprimitive groups,and what is the role of covers and correspondences in going from algebraic equations to zeta functions with Chow motive coefficients.     

Constructing sparse Davenport–Schinzel sequences

For any sequence $u$, the extremal function $Ex(u,j,n)$ is the maximum possible length of a $j$-sparse sequence with $n$ distinct letters that avoids $u$. We prove that if $u$ is an alternating sequence $abab\dots$ of length $s$, then $Ex(u,j,n)=\Theta \left(s{n}^2\right)$ for all $j\ge 2$ and $s\ge n$, answering a question of Wellman and Pettie (2018) and extending the result of Roselle and Stanton that $Ex(u,2,n)=\Theta \left(s{n}^2\right)$ for any alternation $u$ of length $s\ge n$ (Roselle and Stanton, 1971).Wellman and Pettie also asked how large must $s\left(n\right)$ be for there to exist $n$-block $DS(n,s\left(n\right))$ sequences of length $\Omega \left(n^{2-o\left(1\right)}\right)$. We answer this question by showing that the maximum possible length of an $n$-block $DS(n,s\left(n\right))$ sequence is $\Omega \left(n^{2-o\left(1\right)}\right)$ if and only if $s\left(n\right)=\Omega \left(n^{1-o\left(1\right)}\right)$. We also show related results for extremal functions of forbidden 0–1 matrices with any constant number of rows and extremal functions of forbidden sequences with any constant number of distinct letters.     

Remarks on a generalization of the Davenport constant

A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let denote the smallest ? such that each sequence over G of length at least ? has k disjoint non-empty zero-sum subsequences. For general G, expanding on known results, upper and lower bounds on these invariants are investigated and it is proved that the sequence is eventually an arithmetic progression with difference exp(G), and several questions arising from this fact are investigated. For elementary 2-groups, is investigated in detail; in particular, the exact values are determined for groups of rank four and five (for rank at most three they were already known).     

Davenport constant for semigroups

Let G be a finite commutative semigroup. The Davenport constant of G is the smallest integer d such that, every sequence S of d elements in G contains a subsequence T (≠S) with the same product of S. Let . Among other results, we determine D(R ^×)−D(U(R)), where R ^× is the multiplicative semigroup of R and U(R) is the group of units of R.     

Comparison of various generalizations of continued fractions

We use the Euler, Jacobi, Poincaré, and Brun matrix algorithms as well as two new algorithms to evaluate the continued fraction expansions of two vectorsL related to two Davenport cubic formsg ₁ andg ₂. The Klein polyhedra ofg ₁ andg ₂ were calculated in another paper. Here the integer convergentsP _k given by the cited algorithms are considered with respect to the Klein polyhedra. We also study the periods of these expansions. It turns out that only the Jacobi and Bryuno algorithms can be regarded as satisfactory. Translated fromMatematicheskie Zametki, Vol. 61, No. 3, pp. 339–348, March, 1997. Translated by V. E. Nazaikinskii     

Lower bounds on Davenport–Schinzel sequences via rectangular Zarankiewicz matrices

An order-$s$Davenport–Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function of $n$ and $s$. When $s$ is fixed this problem has been settled (see Agarwal, Sharir, and Shor, 1989, Nivasch, 2010 and Pettie, 2015) but when $s$ is a function of $n$, very little is known about the extremal function $\lambda (s,n)$ of such sequences.In this paper we give a new recursive construction of Davenport–Schinzel sequences that is based on dense 0–1matrices avoiding large all-1 submatrices (aka Zarankiewicz’s Problem ). In particular, we give a simple construction of $n^{2∕t}\times n$ matrices containing $n^{1+1∕t}$ 1s that avoid $t\times 2$ all-1 submatrices. (This result seems to be absent from the literature on Zarankiewicz’s problem, but it may be considered folklore among experts in this area [Z. Füredi, personal communication, 2017].)Our lower bounds on $\lambda (s,n)$ exhibit three qualitatively different behaviors depending on the size of $s$ relative to $n$. When $s\le loglogn$ we show that $\lambda (s,n)∕n\ge 2^s$ grows exponentially with $s$. When $s=n^{o\left(1\right)}$ we show $\lambda (s,n)∕n\ge {\left(\frac{s}{2log{log}_{s}n}\right)}^{log{log}_{s}n}$ grows faster than any polynomial in $s$. Finally, when $s=\Omega (n^{1∕t}(t?1)!)$, $\lambda (s,n)=\Omega (n^{2}s∕(t?1)!)$ matches the trivial upper bound $O\left(n^{2}s\right)$ asymptotically, whenever $t$ is constant.