Proportionally modular diophantine inequalities and their multiplicity

Let I be an interval of positive rational numbers. Then the set S （I） = T ∩ N, where T is the submonoid of （Q0＋, ＋） generated by T, is a numerical semigroup. These numerical semigroups are called proportionally modular and can be characterized as the set of integer solutions of a Diophantine inequality of the form ax rood b 〈 cx. In this paper we are interested in the study of the maximal intervals I subject to the condition that S （I） has a given multiplicity. We also characterize the numerical semigroups associated with these maximal intervals.     

Systems of proportionally modular Diophantine inequalities

The set of integer solutions to the inequality ax mod b≤c x is a numerical semigroup. We study numerical semigroups that are intersections of these numerical semigroups. Recently it has been shown that this class of numerical semigroups coincides with the class of numerical semigroups having a Toms decomposition. The first author was (partially) supported by the Centro de Matemática da Universidade do Porto (CMUP), financed by FCT (Portugal) through the programmes POCTI and POSI, with national and European Community structural funds. The last three authors are supported by the project MTM2004-01446 and FEDER funds. The authors would like to thank the referee for her/his comments and suggestions.     

Weighted modular inequalities for Hardy-Steklov operators

We characterize weighted modular inequalities of weak and strong type for the Hardy-Steklov operators T defined by , where g is a positive function and s, h are increasing and continuous functions such that s(x)?h(x) for all x.     

On two Diophantine inequalities over primes

Let $1<c<37∕18,c\ne 2$ and $N$ be a sufficiently large real number. In this paper, we prove that, for almost all $R\in (N,2N]$, the Diophantine inequality $|p_1^c+p_2^c+p_3^c?R|<{log}^{?1}N$ is solvable in primes $p_1,p_2,p_3$. Moreover, we also investigate the problem of six primes and prove that the Diophantine inequality $|p_1^c+p_2^c+p_3^c+p_4^c+p_5^c+p_6^c?N|<{log}^{?1}N$ is solvable in primes $p_1,p_2,p_3,p_4,p_5,p_6$ for sufficiently large real number $N$.     

On a family of relative quartic Thue inequalities

We consider the relative Thue inequalities

|X⁴−t²X²Y²+s²Y⁴|?²|t|−²|s|−2,     

Vectors of given diophantine type

For a function ?(y) = o(y ^?1/s ), y → ∞, we prove the existence of vectors ?∈? ^s admitting, for any ε > 0, infinitely many simultaneous ?(1 + ε-approximations, but not admitting any simultaneous ?-approximations.     

On simultaneous diophantine approximations. Vectors of given diophantine type

For any monotone functionψ(y)=O(y ^1/s), we prove the existence of a continual family of vectors (α₁...,α_s) admitting infinitely many simultaneous ψ-approximations, but nocψ-approximations with some constantc>0. Translated fromMatematicheskie Zametki, Vol. 61, No. 5, pp. 706–716, May, 1997. Translated by S. K. Lando     

A diophantine problem concerning cubes

This paper deals with the problem of finding n integers such that their pairwise sums are cubes. We obtain eight integers, expressed in parametric terms, such that all the six pairwise sums of four of these integers are cubes, 9 of the 10 pairwise sums of five of these integers are cubes, 12 pairwise sums of six of these integers are cubes, 15 pairwise sums of seven of these integers are cubes and 18 pairwise sums of all the eight integers are cubes. This leads to infinitely many examples of four positive integers such that all of their six pairwise sums are cubes. Further, for any arbitrary positive integer n, we obtain a set of 2(n+1) integers, in parametric terms, such that 5n+1 of the pairwise sums of these integers are cubes. With a choice of parameters, we can obtain examples with 5n+2 of the pairwise sums being cubes.     

Correlation Inequalities

The main point of this note is to give a simple semigroup proof of a correlation inequality due to Hu , [H]. We also recover recent correlation inequalities due to Houdré , Pérez–Abreu and Surgailis , [HPS] and obtain some new correlation inequalities on Lie groups.     

Numerical Semigroups with a Monotonic Apery Set

We study numerical semigroups S with the property that if m is the multiplicity of S and w(i) is the least element of S congruent with i modulo m, then 0 < w(1) < ... < w(m − 1). The set of numerical semigroups with this property and fixed multiplicity is bijective with an affine semigroup and consequently it can be described by a finite set of parameters. Invariants like the gender, type, embedding dimension and Frobenius number are computed for several families of this kind of numerical semigroups. This paper was supported by the project BFM2000-1469. The fourth author wishes to acknowledge support from the Universidade de Evora and the CIMA-UE.     

Wasserstein-Divergence transportation inequalities and polynomial concentration inequalities

In this paper, we study Wasserstein-Divergence transportation inequalities which are the generalization of classical transportation inequalities. We present sufficient and necessary conditions for them separately, which coincide in the limit case. Using this kind of inequalities, we establish polynomial concentration inequalities for probability measures with no exponential moments.     

Rosenthal inequalities in noncommutative symmetric spaces

We give a direct proof of the ‘upper’ Khintchine inequality for a noncommutative symmetric (quasi-)Banach function space with nontrivial upper Boyd index. This settles an open question of C. Le Merdy and the fourth named author (Le Merdy and Sukochev, 2008 [24]). We apply this result to derive a version of Rosenthal?s theorem for sums of independent random variables in a noncommutative symmetric space. As a result we obtain a new proof of Rosenthal?s theorem for (Haagerup) Lp-spaces.     

General criteria for redundant and nonredundant linear inequalities

A system of linear inequalities subject to nonnegativity restrictions is considered. General criteria which are necessary and sufficient for a linear inequality to be redundant are derived. This general characterization provides a basis for unifying some of the existing techniques. After taking into consideration the existence of redundant linear inequalities, general necessary and sufficient criteria for a linear inequality to be nonredundant are also obtained. An example is given to illustrate the application of these new criteria.The author wishes to thank the referee for his comments.     

Volumes and diophantine inequalities associated with decomposable forms

For homogeneous decomposable forms in n variables with real coefficients, we consider the associated volume of all real solutions to the inequality . We relate this to the number of integral solutions to the Diophantine inequality in the case where F has rational coefficients. We find quantities which bound the volume and which yield good upper bounds on the number of solutions to the Diophantine inequality in the rational case.     

Weighted Hardy inequalities

For bounded Lipschitz domains D in it is known that if 1<p<∞, then for all β[0,β₀), where β₀=p−1>0, there is a constant c<∞ with

for all . We show that if D is merely assumed to be a bounded domain in that satisfies a Whitney cube-counting condition with exponent λ and has plump complement, then the same inequality holds with β₀ now taken to be . Further, we extend the known results (see [H. Brezis, M. Marcus, Hardy's inequalities revisited, Dedicated to Ennio De Giorgi, Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 25 (1997–1998) 217–237; M. Hoffmann-Ostenhof, T. Hoffmann-Ostenhof, A. Laptev, A geometrical version of Hardy's inequality, J. Funct. Anal. 189 (2002) 537–548; J. Tidblom, A geometrical version of Hardy's inequality for W^1,p(Ω), Proc. Amer. Math. Soc. 132 (2004) 2265–2271]) concerning the improved Hardy inequality

c=c(n,p), by showing that the class of domains for which the inequality holds is larger than that of all bounded convex domains.     

The relationship between the nonexistence of generalized bent functions and diophantine equations

Two new results on the nonexistence of generalized bent functions are presented by using properties of the decomposition law of primes in cyclotomic fields and properties of solutions of some Diophantine equations, and examples satisfying our results are given.     

Isoperimetry and symmetrization for logarithmic Sobolev inequalities

Using isoperimetry and symmetrization we provide a unified framework to study the classical and logarithmic Sobolev inequalities. In particular, we obtain new Gaussian symmetrization inequalities and connect them with logarithmic Sobolev inequalities. Our methods are very general and can be easily adapted to more general contexts.     

Weak logarithmic Sobolev inequalities and entropic convergence

In this paper we introduce and study a weakened form of logarithmic Sobolev inequalities in connection with various others functional inequalities (weak Poincaré inequalities, general Beckner inequalities, etc.). We also discuss the quantitative behaviour of relative entropy along a symmetric diffusion semi-group. In particular, we exhibit an example where Poincaré inequality can not be used for deriving entropic convergence whence weak logarithmic Sobolev inequality ensures the result.      

Equivalent proportionally modular Diophantine inequalities

We study Diophantine inequalities of the form ax mod b ≤ cx. In particular, we prove that there exists a positive integer such that for every integer n ≥ N there exist a′, c′ (positive integers dependent of n) such that a′ x mod n ≤ c′ x has the same solutions as the above inequality. Received: 23 March 2007