Modern thermodynamics as a branch of mathematics (mathematical physics)

In the paper, it is proved that, if f(x₁,..., x_n)g(y₁,..., y_m) is a multilinear central polynomial for a verbally prime T-ideal Γ over a field of arbitrary characteristic, then both polynomials f(x₁,..., x_n) and g(y₁,..., y_m) are central for Γ.     

A note on the numerical evaluation of finite integrals of oscillatory functions

A method is described for the numerical evaluation of integrals of the form ∫ _?1 ¹ f(x)K(m,x)dx, wheref(x) is smooth in [?1,1], whileK(m,x) is highly oscillatory for large values ofm.     

A lower bound for the circumference of a graph

Let G=(V, E) be a block of order n, different from K_n. Let m=min {d(x)+d(y): [x, y]?E}. We show that if m?n then G contains a cycle of length at least m.     

Automorphisms of the tensor product of Abelian and Grassmannian algebras

We consider an algebraB _n,m , over the field R with n+m generators x_i,..., x_n, ξ₁,..., η_m, satisfying the following relations: (1') $$\left[ {x_k ,x_l } \right] \equiv x_k x_l - x_l x_k = 0,[x_k ,\xi _i ] = 0,$$ , (2') $$\left\{ {\xi _i ,\xi _j } \right\} \equiv \xi _i \xi _j + \xi _j \xi _i = 0$$ , where k,l =1, ..., n and i, j=1,..., m. In this algebra we define differentiation, integration, and also a group of automorphisms. We obtain an integration equation invariant with respect to this group, which coincides in the case m=0 with the equation for the change of variables in an integral, an equation whichis well known in ordinary analysis; in the case n=0 our equation coincides with F. A. Berezin's result [1, 3] for integration over a Grassman algebra.     

The algebraic structure of the set of solutions to the Thue equation

Let Fn be a binary form with integral coefficients of degree n?2, let d denote the greatest common divisor of all non-zero coefficients of Fn, and let h?2 be an integer. We prove that if d=1 then the Thue equation (T) Fn(x,y)=h has relatively few solutions: if A is a subset of the set T(Fn,h) of all solutions to (T), with r:=card(A)?n+1, then

(#)

h divides the numberΔ(A):=_∏1?k<l?rδ(ξk,ξl),

where ξk=〈xk,yk〉∈A, 1?k?r, and δ(ξk,ξl)=xkyl−xlyk. As a corollary we obtain that if h is a prime number then, under weak assumptions on Fn, there is a partition of T(Fn,h) into at most n subsets maximal with respect to condition (#).     

Effective Fast Algorithms for Polynomial Spectral Factorization

Let p(z) be a polynomial of degree n having zeros |ξ₁|≤???≤|ξ _m |<1<|ξ _m+1|≤???≤|ξ _n |. This paper is concerned with the problem of efficiently computing the coefficients of the factors u(z)=∏ _i=1 ^m (z?ξ _i ) and l(z)=∏ _i=m+1 ⁿ (z?ξ _i ) of p(z) such that a(z)=z ^?m p(z)=(z ^?m u(z))l(z) is the spectral factorization of a(z). To perform this task the following two-stage approach is considered: first we approximate the central coefficients x _?n+1,. . .x _n?1 of the Laurent series x(z)=∑ _i=?∞ ^+∞ x _i z ⁱ satisfying x(z)a(z)=1; then we determine the entries in the first column and in the first row of the inverse of the Toeplitz matrix T=(x _i?j ) _i,j=?n+1,n?1 which provide the sought coefficients of u(z) and l(z). Two different algorithms are analyzed for the reciprocation of Laurent polynomials. One algorithm makes use of Graeffe's iteration which is quadratically convergent. Differently, the second algorithm directly employs evaluation/interpolation techniques at the roots of 1 and it is linearly convergent only. Algorithmic issues and numerical experiments are discussed.     

Über komplementäre Ungleichungen mit drei Mittelwerten. Teil 2

In Part 1 we obtained lower and upper bounds of the expressionf(M _φ(x;α),M _ψ(y;α))?M _χ(f(x,y);α) by replacing the given sets(x)=(x ₁,...,x _n ),(y)=(y ₁,...,y _n ) by two suitably chosen sets ((u)=(u ₁,...,u _m ),(v)=(v ₁,...,v _m ), in general withm≥4. Now, in the case of upper bounds, the numberm will, under additional hypotheses, be reduced tom=3 (§ 4) and finally tom=2 (§ 5). Inequalities, complementary to the inequalities of Hölder and Minkowski and to another inequality are given as illustrations.     

Distribution of lattice points on surfaces of second order

Let f₁(x₁,..., xl₁) and f₂(y₁,...,yl₂) be positive definite primitive quadratic forms in l₁ and l₂ variables, respectively. We obtain new results in the well-known problem on the number of lattice points on the cone f₁(x₁,...,xl₁)=f₂(y₁,...,yl₂), in the domain f₁(x₁,...,xl₁)≦N for N»∞. Our technical tool is the Rankin-Selberg convolution. In several special cases the results can be sharpened by other methods. In addition, new facts concerning the uniform distribution of lattice points on ellipsoids in l variables, l odd, l≧5 are obtained.     

Über komplementäre Ungleichungen mit drei Mittelwerten. Teil 1

Earlier investigations are extended to inequalities with three means of the formf(M _? (x;α),M _Ψ (y;α))?M _χ (f(x,y);α)≧0 (I). Replacing the given basic sets (x)=(x ₁,...,x _n ) and (y)=(y ₁,...,y _n ) by two suitably chosen sets (u)=(u ₁,...,u _m ) and (v)=(v ₁,...,v _m ), lower or upper bounds on the left side of (I) can be obtained. In the case of upper bounds these inequalities are complementary to (I). In general, the numberm is not less than 4; it may be reduced under additional hypotheses. Some examples (inequalities complementary to some additive inequalities) are given.     

The Jacobian problem as a system of ordinary differential equations

LetP=x ⁿ +P _n?1(y)x ^n?1+…+P ₀(y),Q=x ^m +Q _m?2(y)x ^m?2+…+Q ₀(y) belong toK[x, y], whereK is a field of characteristic zero. The main result of this paper is the following: Assume thatP _x Q _y ?P _y Q _x =1. Then:*

1. K[Q _m?2(y), …,Q ₀(y)]=K[y],
2. K[P, Q]=K[x, y] ifQ=x ^m +Q _k (y)x ^k +Q _r (y)x ^r

     

Multiplication operators in Köthe-Bochner spaces

Let X be a Banach space and E an order continuous Banach function space over a finite measure μ. We prove that an operator T in the Köthe-Bochner space E(X) is a multiplication operator (by a function in L^∞(μ)) if and only if the equality T(g〈f,x^∗〉x)=g〈T(f),x^∗〉x holds for every g∈L^∞(μ), f∈E(X), x∈X and x^∗∈X^∗.     

Semidefinite descriptions of low-dimensional separable matrix cones

Let K⊂E, K^′⊂E^′ be convex cones residing in finite-dimensional real vector spaces. An element y in the tensor product E⊗E^′ is K⊗K^′-separable if it can be represented as finite sum , where x_l∈K and for all l. Let S(n), H(n), Q(n) be the spaces of n×n real symmetric, complex Hermitian and quaternionic Hermitian matrices, respectively. Let further S₊(n), H₊(n), Q₊(n) be the cones of positive semidefinite matrices in these spaces. If a matrix A∈H(mn)=H(m)⊗H(n) is H₊(m)⊗H₊(n)-separable, then it fulfills also the so-called PPT condition, i.e. it is positive semidefinite and has a positive semidefinite partial transpose. The same implication holds for matrices in the spaces S(m)⊗S(n), H(m)⊗S(n), and for m?2 in the space Q(m)⊗S(n). We provide a complete enumeration of all pairs (n,m) when the inverse implication is also true for each of the above spaces, i.e. the PPT condition is sufficient for separability. We also show that a matrix in Q(n)⊗S(2) is Q₊(n)⊗S₊(2)- separable if and only if it is positive semidefinite.     

On the enumeration of certain weighted graphs

We enumerate weighted simple graphs with a natural upper bound condition on the sum of the weight of adjacent vertices. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that the generating function for connected bipartite simple graphs is of the form p₁(x)/(1-x)^m+1. For nonbipartite simple graphs, we get a generating function of the form p₂(x)/(1-x)^m+1(1+x)^l. Here m is the number of vertices of the graph, p₁(x) is a symmetric polynomial of degree at most m, p₂(x) is a polynomial of degree at most m+l, and l is a nonnegative integer. In addition, we give computational results for various graphs.     

A note on the probabilistic approach to Turán's problem

The Turán number T(n, l, k) is the smallest possible number of edges in a k-graph on n vertices such that every l-set of vertices contains an edge. Given a k-graph H = (V(H), E(H)), we let X_s(S) equal the number of edges contained in S, for any s-set S?V(H). Turán's problem is equivalent to estimating the expectation E(X_l), given that min(X_l) ≥ 1. The following lower bound on the variance of X_s is proved:

$\text{Var(X}{}_{\mathrm{s}}\text{)?mm}\text{n?2k}\text{s?k}\text{n}\text{s}{}^{\mathrm{?1}}\text{n}\text{k}{}^1$

, where m = |E(H)| and $\text{m}\text{= (}{}_{\mathrm{k}}{}^{\mathrm{n}}\text{) ? m}$. This implies the following: putting t(k, l) = lim_n→∞T(n, l, k)(_kⁿ)^?1 then t(k, l) ≥ T(s, l, k)((_k^s) ? 1)^?1, whenever s ≥ l > k ≥ 2. A connection of these results with the existence of certain t-designs is mentioned.     

The operator-valued Feynman-Kac formula with noncommutative operators

Let X(t) be a right-continuous Markov process with state space E whose expectation semigroup S(t), given by S(t) φ(x) = E_x[φ(X(t))] for functions φ mapping E into a Banach space L, has the infinitesimal generator A. For each x?E, let V(x) generate a strongly continuous semigroup T_x(t) on L. An operator-valued Feynman-Kac formula is developed and solutions of the initial value problem $\text{?u}\text{?t}\text{= Au + V(x)u, u(0) = φ}$ are obtained. Fewer conditions are assumed than in known results; in particular, the semigroups {T_x(t)} need not commute, nor must they be contractions. Evolution equation theory is used to develop a multiplicative operative functional and the corresponding expectation semigroup has the infinitesimal generator A + V(x) on a restriction of the domain of A.     

The diagnonal multivariate natural exponential families and their classification

A natural exponential family (NEF)F in ? ⁿ ,n>1, is said to be diagonal if there existn functions,a ₁,...,a _n , on some intervals of ?, such that the covariance matrixV _F (m) ofF has diagonal (a ₁(m ₁),...,a _n (m _n )), for allm=(m ₁,...,m _n ) in the mean domain ofF. The familyF is also said to be irreducible if it is not the product of two independent NEFs in ? ^k and ? ^n-k , for somek=1,...,n?1. This paper shows that there are only six types of irreducible diagonal NEFs in ? ⁿ , that we call normal, Poisson, multinomial, negative multinomial, gamma, and hybrid. These types, with the exception of the latter two, correspond to distributions well established in the literature. This study is motivated by the following question: IfF is an NEF in ? ⁿ , under what conditions is its projectionp(F) in ? ^k , underp(x ₁,...,x _n )∶=(x ₁,...,x _k ),k=1,...,n?1, still an NEF in ? ^k ? The answer turns out to be rather predictable. It is the case if, and only if, the principalk×k submatrix ofV _F (m ₁,...,m _n ) does not depend on (m _k+1,...,m _n ).     

A complete parametrization of cyclic field extensions of 2-power degree

Letq be a power of 2 at least equal to 8 and ζ be a primitiveq-th root of unity, and letK be any field of characteristic zero. We define the group of special projective conormsS _K as a quotient of the group of elements ofK(ζ) of norm 1:S _K is obviously trival if the groul Gal (K(ζ)/K) is cyclic. We prove that for some fieldsK, the groupS _K is finite, and it is even trivial for certain fields such as ? or ?(X ₁,...,X _m). We then prove that the groupS _K completely paramatrizes the cycle extensions ofK of degreeq. We exhibit an explicit polynomial defined over ?(T ₀,...,T _q/2) which parametrizes all cyclic extensions ofK of degreeq associated to the trivial element ofS _K. In particular, this polynomial parametrizes all cyclic extensions ofK of degreeq whenever the groupS _K is trivial.     

Representations of matroids and free resolutions for multigraded modules

Let k be a field, let R=k[x₁,…,xm] be a polynomial ring with the standard Zm-grading (multigrading), let L be a Noetherian multigraded R-module, and let be a finite free multigraded presentation of L over R. Given a choice S of a multihomogeneous basis of E, we construct an explicit canonical finite free multigraded resolution T_•(Φ,S) of the R-module L. In the case of monomial ideals our construction recovers the Taylor resolution. A main ingredient of our work is a new linear algebra construction of independent interest, which produces from a representation ? over k of a matroid M a canonical finite complex of finite dimensional k-vector spaces T_•(?) that is a resolution of Ker?. We also show that the length of T_•(?) and the dimensions of its components are combinatorial invariants of the matroid M, and are independent of the representation map ?.     

Continuous approximation of random function

Modifying the methods of Lee [J. Math. Anal. Appl.61 (1977), 1–6], we show that each μ-measurable mapping f on a normal space T into a separable linear metric space E is almost continuous, where μ is a Radon probability measure. It is shown that for every ε > 0 there exists a compact subset K_ε ? T with μ(K_ε) > 1 ? ε and an elementary function g(t) = ∑ⁿ_{i = 1}h_i(t) x_i such that μ(t?K_ε; f(t) ≠ g(t)) < ε, where x_i?E and h_i(t) are real bounded continuous functions with disjoint supports.