Search

Let a function f belongs to the Lebesgue class $$L^p({{\mathbb {R}}})$$ , $$1\le p\le 2$$ , and let $${\widehat{f}}$$ be the Fourier transform of f. The classical theorem of E. Titchmarsh states that if the function f belongs to the Lipschitz class $$Lip(\alpha ,p; {{\mathbb {R}}})$$ , $$00$$ .

A classical theorem of Koksma states that for Lebesgue almost every $x>1$ the sequence $(x^n)_{n=1}^{\infty}$ is uniformly distributed modulo one. In the present paper we extend Koksma's theorem to the pair correlation setting. More precisely, we show that for Lebesgue almost every $x>1$ the pair correlations of the fractional parts of $(x^n)_{n=1}^{\infty}$ are asymptotically Poissonian. The proof is based on a martingale approximation method., Version 2: some minor changes. The paper will appear in the Israel Journal of Mathematics

Let a function f belong to the Lebesgue class , , and let be the Fourier transform of f. The classical theorem of E. Titchmarsh states that if the function f belongs to the Lipschitz class , , then...

A classical theorem of Hutchinson asserts that if an iterated function system acts on $\mathbb {R}^{d}$ by similitudes and satisfies the open set condition then it admits a unique self-similar measure with Hausdorff dimension equal to the dimension of the attractor. In the class of measures on the attractor, which arise as the projections of shift-invariant measures on the coding space, this self-similar measure is the unique measure of maximal dimension. In the context of affine iterated function systems it is known that there may be multiple shift-invariant measures of maximal dimension if the linear parts of the affinities share a common invariant subspace, or more generally if they preserve a finite union of proper subspaces of $\mathbb {R}^{d}$ . In this paper we give an example where multiple invariant measures of maximal dimension exist even though the linear parts of the affinities do not preserve a finite union of proper subspaces.

Let G be a finite group. A classical theorem of Burnside shows that a group with order divisible by at most two primes is solvable. The aim of this article is studying finite groups each of whose v...

Let $$G$$ be a locally compact bounded Vilenkin group, $$\Gamma$$ be the dual group of $$G$$ . Suppose that a function $$f(x)$$ belongs to the the Lebesgue class $$L^p(G)$$ , $$10$$ , $$\beta\in{\mathbb R}$$ , then for which values of $$r$$ we can guarantee that $$\widehat{f}\in L^r(\Gamma)$$ ? The result is an analogue of one classical theorem of E. Titchmarsh about the Fourier transform of functions from the Lipschitz classes on $${\mathbb R}$$ .

This paper deals with normal submanifolds immersed in a Riemannian manifold $${\overline{M}}$$ . We generalized some recent results of surfaces in space forms obtained by Hernandez-Lamoneda and Ruiz-Hernandez (Bull Braz Marh Soc (NS) 49:447–462, 2018) to arbitrary submanifolds. More precisely, given a submanifold M in $${\overline{M}}$$ , we study the submanifolds formed by orthogonal geodesics to M, and call it a ruled normal submanifold to M. In the first part of this paper, we analyze these submanifolds and establish some geometric properties of them. Furthermore, we extend some properties about the lines of curvature and using the ideas of [3] also give an extension of the classical Theorem of Bonnet to hypersurfaces of $${\overline{M}}$$ .

The high-dimensional version of Fatou’s classical theorem asserts that the Poisson semigroup of a function $$f\in L_{p}(\mathbb {R}^{n}), \ 1\le p \le \infty $$, converges to f non-tangentially at Lebesque points. In this paper we investigate the rate of non-tangential convergence of Poisson and metaharmonic semigroups at $$\mu $$-smoothness points of f.

We study Fourier transforms of regular holonomic ${\mathcal{D}}$-modules. In particular, we show that their solution complexes are monodromic. An application to direct images of some irregular holonomic ${\mathcal{D}}$-modules will be given. Moreover, we give a new proof of the classical theorem of Brylinski and improve it by showing its converse.

The famous Erdős–Gallai theorem on the Turán number of paths states that every graph with n vertices and m edges contains a path with at least (2m)/n edges. In this note, we first establish a simple but novel extension of the Erdős–Gallai theorem by proving that every graph G contains a path with at least $${{(s + 1){N_{s + 1}}(G)} \over {{N_s}(G)}} + s - 1$$ edges, where Nj(G) denotes the number of j-cliques in G for 1≤ j ≤ ω(G). We also construct a family of graphs which shows our extension improves the estimate given by the Erdős–Gallai theorem. Among applications, we show, for example, that the main results of [20], which are on the maximum possible number of s-cliques in an n-vertex graph without a path with ℓ vertices (and without cycles of length at least c), can be easily deduced from this extension. Indeed, to prove these results, Luo [20] generalized a classical theorem of Kopylov and established a tight upper bound on the number of s-cliques in an n-vertex 2-connected graph with circumference less than c. We prove a similar result for an n-vertex 2-connected graph with circumference less than c and large minimum degree. We conclude this paper with an application of our results to a problem from spectral extremal graph theory on consecutive lengths of cycles in graphs.

Let ℚp be the field of p-adic numbers, a function f(x) belongs to the the Lebesgue class Lρ(ℚp), 1 ρ ≤ 2, and let $$\hat{f}(\xi)$$ be the Fourier transform of f. In this paper we give an answer to the next problem: if the function f belongs to the Dini-Lipschitz class DLip(α, β, ρ; ℚp), α > 0, β ∈ ℝ, then for which values of r we can guarantee that $$\hat{f} \in {L^r}(\mathbb{Q}_p)$$? The result is an analogue of one classical theorem of E. Titchmarsh about the Fourier transform of functions from the Lipschitz classes on ℝ.

Consider $n$ players having preferences over the connected pieces of a cake, identified with the interval $[0,1]$. A classical theorem, found independently by Stromquist and by Woodall in 1980, ensures that, under mild conditions, it is possible to divide the cake into $n$ connected pieces and assign these pieces to the players in an envy-free manner, i.e, such that no player strictly prefers a piece that has not been assigned to her. One of these conditions, considered as crucial, is that no player is happy with an empty piece. We prove that, even if this condition is not satisfied, it is still possible to get such a division when $n$ is a prime number or is equal to $4$. When $n$ is at most $3$, this has been previously proved by Erel Segal-Halevi, who conjectured that the result holds for any $n$. The main step in our proof is a new combinatorial lemma in topology, close to a conjecture by Segal-Halevi and which is reminiscent of the celebrated Sperner lemma: instead of restricting the labels that can appear on each face of the simplex, the lemma considers labelings that enjoy a certain symmetry on the boundary.

A classical theorem of Baker and Pixley states that if [Formula: see text] is a finite algebra with a majority term and [Formula: see text] is an [Formula: see text]-ary operation on [Formula: see text] which preserves every subuniverse of [Formula: see text], then [Formula: see text] is representable by a term in [Formula: see text]. We give a generalizacion of this theorem for the case in which [Formula: see text] is a finite algebra belonging to some relatively congruence distributive quasivariety.

We formulate a type B extended nilHecke algebra, following the type A construction of Naisse and Vaz. We describe an action of this algebra on extended polynomials and describe some results on the structure on the extended symmetric polynomials. Finally, following Appel, Egilmez, Hogancamp, and Lauda, we prove a result analogous to a classical theorem of Solomon connecting the extended symmetric polynomial ring to a ring of usual symmetric polynomials and their differentials.

By means of a weaker functional model, we prove the existence of non-trivial closed hyperinvariant subspaces for linear bounded operators generalizing, in particular, a classical theorem of Atzmon and revealing the spectral nature of the hyperinvariant subspaces involved. As an application, we show non-trivial spectral subspaces for Bishop operators on $$L^p[0,1)$$ , $$1\le p

For certain sequences $A$ of positive integers with missing $g$-adic digits, the Dirichlet series $F_A(s) = \sum_{a\in A} a^{-s}$ has abscissa of convergence $\sigma_c < 1$. The number $\sigma_c$ is computed. This generalizes and strengthens a classical theorem of Kempner on the convergence of the sum of the reciprocals of a sequence of integers with missing decimal digits., Comment: Minor improvements and corrected typos; 7 pages

A classical theorem of Kempner states that the sum of the reciprocals of positive integers with missing decimal digits converges. This result is extended to much larger families of "missing digits" sets of positive integers with convergent harmonic series., Minor changes, 8 pages

Let $\Gamma$ be a countable group. A classical theorem of Thorisson states that if $X$ is a standard Borel $\Gamma$-space and $\mu$ and $\nu$ are Borel probability measures on $X$ which agree on every $\Gamma$-invariant subset, then $\mu$ and $\nu$ are equidecomposable, i.e. there are Borel measures $(\mu_\gamma)_{\gamma\in\Gamma}$ on $X$ such that $\mu = \sum_\gamma \mu_\gamma$ and $\nu = \sum_\gamma \gamma\mu_\gamma$. We establish a generalization of this result to cardinal algebras.

For nonuniform exponentially bounded evolution families defined on Banach spaces, we introduce a class of Banach function spaces, whose norms are completely determined by the nonuniform behaviour of the corresponding evolution family. We generalize a classical theorem of Datko on these spaces. In addition, we obtain new criteria for the existence of nonuniform stability.

We consider two nested billiards in $\mathbb R^d$, $d\geq3$, with $C^2$-smooth strictly convex boundaries. We prove that if the corresponding actions by reflections on the space of oriented lines commute, then the billiards are confocal ellipsoids. This together with the previous analogous result of the author in two dimensions solves completely the Commuting Billiard Conjecture due to Sergei Tabachnikov. The main result is deduced from the classical theorem due to Marcel Berger saying that in higher dimensions only quadrics may have caustics. We also prove versions of Berger's theorem and the main result for billiards in spaces of constant curvature: space forms., Comment: 21 pages. The main result on commuting billiards and Berger's result on caustics are extended to billiards in spaces of constant curvature

We provide necessary and sufficient conditions for a pair $S,T$ of Hilbert space operators in order that they satisfy $S^*=T$ and $T^*=S$. As a main result we establish an improvement of von Neumann's classical theorem on the positive self-adjointness of $S^*S$ for two variables. We also give some new characterizations of self-adjointness and skew-adjointness of operators, not requiring their symmetry or skew-symmetry, respectively., 10 pages

[EN] With the help of C-contractions having a fixed point, we obtain a characterization of complete fuzzy metric spaces, in the sense of Kramosil and Michalek, that extends the classical theorem of H. Hu (see "Am. Math. Month. 1967, 74, 436-437") that a metric space is complete if and only if any Banach contraction on any of its closed subsets has a fixed point. We apply our main result to deduce that a well-known fixed point theorem due to D. Mihet (see "Fixed Point Theory 2005, 6, 71-78") also allows us to characterize the fuzzy metric completeness., This research was partially funded by Ministerio de Ciencia, Innovacion y Universidades, under grant PGC2018-095709-B-C21 and AEI/FEDER, UE funds.

International audience; The classical theorem of Erdős & Wintner furnishes a criterion for the existence of a limiting distribution for a real, additive arithmetical function. This work is devoted to providing an effective estimate for the remainder term under the assumption that the conditions in the criterion are fulfilled. We also investigate the case of a conditional distribution.

The classical theorem of Picard states that a non-constant holomorphic function $f:\mathbb{C}\to\mathbb{C}$ can avoid at most one value. We investigate how many values a non-constant slice regular function of a quaternionic variable $f:\mathbb{H}\to\mathbb{H}$ may avoid., Comment: 15 pages. To appear on Proc. Americ. Math. Soc. (2020)

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which $\left(\omega^\omega,\le^*\right)$ contains a cofinal order-isomorphic copy of P. In this paper, we prove a consistency result concerning the universality of the higher analogue $\left(\kappa^\kappa,\le^S\right)$: Theorem. Assume GCH. For every regular uncountable cardinal $\kappa$, there is a cofinality-preserving GCH-preserving forcing extension in which for every analytic quasi-order Q over $\kappa^\kappa$ and every stationary subset S of $\kappa$, there is a Lipschitz map reducing Q to $(\kappa^\kappa,\le^S)$., Comment: Slow filtrations made explicit in the LCC derivation

We consider nonlinear problems governed by the fractional p-Laplacian in presence of nonlocal Neumann boundary conditions and we show three different existence results: the first two theorems deal with a p-superlinear term, the last one with a source having p-linear growth. For the p-superlinear case we face two main difficulties. First: the p-superlinear term may not satisfy the Ambrosetti-Rabinowitz condition. Second, and more important: although the topological structure of the underlying functional reminds the one of the linking theorem, the nonlocal nature of the associated eigenfunctions prevents the use of such a classical theorem. For these reasons, we are led to adopt another approach, relying on the notion of linking over cones.

We revisit the classical problem due to Weyl, as well as its generalisations, concerning the isometric immersions of $\mathbb{S}^2$ into simply-connected $3$-dimensional Riemannian manifolds with non-negative Gauss curvature. A sufficient condition is exhibited for the existence of global $C^{1,1}$-isometric immersions. Our developments are based on the framework \`{a} la Labourie (Immersions isom\'{e}triques elliptiques et courbes pseudo-holomorphes, J. Diff. Geom. 30 (1989), 395--424) of studying isometric immersions using $J$-holomorphic curves. We obtain along the way a generalisation of a classical theorem due to Heinz and Pogorelov., Comment: 11 pages

A classical theorem due to Wadsley implies that, on a connected contact manifold all of whose Reeb orbits are closed, there is a common period for the Reeb orbits. In this paper we show that, for any Reeb flow on a closed connected 3-manifold, the following conditions are actually equivalent: (1) every Reeb orbit is closed; (2) all closed Reeb orbits have a common period; (3) the action spectrum has rank 1. We also show that, on a fixed closed connected 3-manifold, a contact form with an action spectrum of rank 1 is determined (up to pull-back by diffeomorphisms) by the set of minimal periods of its closed Reeb orbits., Comment: 18 pages; version 3: we specified that the contact manifolds are required to be connected. To appear in Commentarii Mathematici Helvetici

This paper is devoted to the investigation of a kind of generalized Caputo semilinear fractional differential inclusions with deviated-advanced nonlocal conditions. Solvability of the problem is established by means of the Leray-Schauder’s alternative approach with the help of the Lagrange mean-value classical theorem. Finally, some examples are given to delineate the efficient of theoretical results.

We state and prove a refinement of a classical theorem due to Landau on the Koebe domains for certain families of holomorphic functions introduced by A. W. Goodman. Our geometric approach in this article enables us to derive several statements of interest, which would not be produced via the methods in Goodman's paper, as immediate corollaries of the proof of the main theorem.

In this paper, we give a method to compute the Gelfand-Kirillov dimensions of some polynomial type weight modules. These modules are infinite-dimensional irreducible 𝔬(n,ℂ)-modules and 𝔰𝔭(2n,ℂ)-modules that appeared in the ℤ-graded oscillator generalizations of the classical theorem on harmonic polynomials established by Luo and Xu. We also found that some of these modules have the secondly minimal GK-dimension, and some of them have the larger GK-dimension than the maximal GK-dimension apearing in unitary highest-weight modules.

We prove a Tverberg type theorem: Given a set $$A \subset \mathbb {R}^d$$ in general position with $$|A|=(r-1)(d+1)+1$$ and $$k\in \{0,1,\ldots ,r-1\}$$ , there is a partition of A into r sets $$A_1,\ldots ,A_r$$ (where $$|A_j|\le d+1$$ for each j) with the following property. There is a unique $$z \in \bigcap _{j=1}^r \mathrm {aff}\,A_j$$ and it can be written as an affine combination of the element in $$A_j$$ : $$z=\sum _{x\in A_j}\alpha (x)x$$ for every j and exactly k of the coefficients $$\alpha (x)$$ are negative. The case $$k=0$$ is Tverberg’s classical theorem.

A classical theorem of Adams, Harris, and Switzer states that the 0th grading of complex $K$-theory cooperations, $KU_0ku$ is isomorphic to the space of numerical polynomials. The space of numerical polynomials has a basis provided by the binomial coefficient polynomials, which gives a basis of $KU_0ku$. In this paper, we produce a new $p$-local basis for $KU_0ku_{(p)}$ using the Adams splitting. This basis is established by using well known formulas for the Hazewinkel generators. For $p=2$, we show that this new basis coincides with the classical basis modulo higher Adams filtration., Comment: 1 figure

In this paper we determine the chromatic number of graphs with two odd cycle lengths. Let $G$ be a graph and $L(G)$ be the set of all odd cycle lengths of $G$. We prove that: (1) If $L(G)=\{3,3+2l\}$, where $l\geq 2$, then $\chi(G)=\max\{3,\omega(G)\}$; (2) If $L(G)=\{k,k+2l\}$, where $k\geq 5$ and $l\geq 1$, then $\chi(G)=3$. These, together with the case $L(G)=\{3,5\}$ solved in \cite{W}, give a complete solution to the general problem addressed in \cite{W,CS,KRS}. Our results also improve a classical theorem of Gy\'{a}rf\'{a}s which asserts that $\chi(G)\le 2|L(G)|+2$ for any graph $G$., Comment: 26 pages,accepted version for publication in SIAM J. Discrete Math

We advertise a relatively new and little known subject, bisecting envelopes or deltoids, and illustrate its virtues by giving a short, simple proof to a classical theorem of convex geometry, the 19...

A classical theorem of Malykhin says that if { X α : α ≤ κ } is a family of compact spaces such that t ( X α ) ≤ κ , for every α ≤ κ , then t ( ∏ α ≤ κ X α ) ≤ κ , where t ( X ) is the tightness of a space X . In this paper we prove the following counterpart of Malykhin's theorem for functional tightness: Let { X α : α λ } be a family of compact spaces such that t 0 ( X α ) ≤ κ for every α λ . If λ ≤ 2 κ or λ is less than the first measurable cardinal, then t 0 ( ∏ α λ X α ) ≤ κ , where t 0 ( X ) is the functional tightness of a space X . In particular, if there are no measurable cardinals, then the functional tightness is preserved by arbitrarily large products of compacta. Our result answers a question posed by Okunev.

In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erdos, Pach, Pollack and Tuza. We use these bounds in order to study hyperbolic graphs (in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H(n, δ 0) be the set of graphs G with n vertices and minimum degree δ 0, and J(n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a(n, δ 0) = min{δ(G) | G ∈ H(n, δ 0)}, b(n, δ 0) = max{δ(G) | G ∈ H(n, δ 0)}, α(n, Δ) = min{δ(G) | G ∈ J(n, Δ)} and β(n, Δ) = max{δ(G) | G ∈ J(n, Δ)}. In particular, we obtain bounds for b(n, δ 0) and we compute the precise value of a(n, δ 0), α(n, Δ) and β(n, Δ) for all values of n, δ 0 and Δ, respectively.

Let X and Y be Banach spaces and let \(\Omega \) be a compact Hausdorff space. In 1973, Swartz, in his by now classical theorem, characterized the absolute summability of an operator U from \({\mathcal {C}}(\Omega ,X)\) to Y in terms of its associated operator \(U^{\#}\) and of its representing measure m. We study the interplay between U, \(U^{\#}\), and m in the context of absolutely (r, q)-summing operators, considering the spaces \({\mathcal {C}}_{p}(\Omega , X)\) of p-continuous functions on \(\Omega \), \(1\le p\le \infty \), instead of \({\mathcal {C}}(\Omega ,X) = {\mathcal {C}}_{\infty }(\Omega , X)\). This encompasses the Swartz theorem together with its existing extensions on absolutely (r, q)-summing operators, providing, among others, an improvement even to the Swartz theorem. Counterexamples are exhibited to indicate sharpness of our results.

In this paper, we prove an analogue of Corradi and Hajnal's classical theorem. There exists n0n0 such that for every n∈3Zn∈3Z when n≥n0n≥n0 the following holds. If G is an oriented graph on n vertices and every vertex has both indegree and outdegree at least 7n/187n/18, then G contains a perfect transitive triangle tiling, which is a collection of vertex-disjoint transitive triangles covering every vertex of G . This result is best possible, as, for every n∈3Zn∈3Z, there exists an oriented graph G on n vertices without a perfect transitive triangle tiling in which every vertex has both indegree and outdegree at least ⌈7n/18⌉−1⌈7n/18⌉−1.

We study divisibility in computable integral domains. We develop a technique for coding Σ 2 0 binary trees into the divisibility relation of a computable integral domain. We then use this technique to prove two theorems about non-atomic integral domains. In every atomic integral domain, the divisibility relation is well-founded. We show that this classical theorem is equivalent to ACA 0 over RCA 0 . In every computable non-atomic integral domain there is a Δ 3 0 infinite sequence of proper divisions. We show that this upper bound cannot be improved to Δ 2 0 in general.

A classical theorem of John Thompson on character degrees asserts that if the degree of every ordinary irreducible character of a finite group G is 1 or divisible by a prime pp, then G has a normal pp-complement. We obtain a significant improvement of this result by considering the average of p′-degrees of irreducible characters. We also consider fields of character values and prove several improvements of earlier related results.

In a nutshell, we intend to extend Schoenberg's classical theorem connecting conditionally positive semidefinite functions $F\colon \mathbb{R}^n \to \mathbb{C}$, $n \in \mathbb{N}$, and their positive semidefinite exponentials $\exp(tF)$, $t > 0$, to the case of matrix-valued functions $F \colon \mathbb{R}^n \to \mathbb{C}^{m \times m}$, $m \in \mathbb{N}$. Moreover, we study the closely associated property that $\exp(t F(- i \nabla))$, $t>0$, is positivity preserving and its failure to extend directly in the matrix-valued context.

In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go beyond a classical theorem of G\"ollnitz, which uses three primary and three secondary colors. Their main tool was a deep and difficult four parameter $q$-series identity. In this paper we take a different approach. Instead of adding an eleventh quaternary color, we introduce forbidden patterns and give a bijective proof of a ten-colored partition identity lying beyond G\"ollnitz' theorem. Using a second bijection, we show that our identity is equivalent to the identity of Alladi, Andrews, and Berkovich. From a combinatorial viewpoint, the use of forbidden patterns is more natural and leads to a simpler formulation. In fact, in Part II of this series we will show how our method can be used to go beyond G\"ollnitz' theorem to any number of primary colors., Comment: 22 pages

Given an ideal $\mathcal{I}$ on the positive integers, a real sequence $(x_n)$ is said to be $\mathcal{I}$-statistically convergent to $\ell$ provided that $$ \textstyle \left\{n \in \mathbf{N}: \frac{1}{n}|\{k \le n: x_k \notin U\}| \ge \varepsilon\right\} \in \mathcal{I} $$ for all neighborhoods $U$ of $\ell$ and all $\varepsilon>0$. First, we show that $\mathcal{I}$-statistical convergence coincides with $\mathcal{J}$-convergence, for some unique ideal $\mathcal{J}=\mathcal{J}(\mathcal{I})$. In addition, $\mathcal{J}$ is Borel [analytic, coanalytic, respectively] whenever $\mathcal{I}$ is Borel [analytic, coanalytic, resp.]. Then we prove, among others, that if $\mathcal{I}$ is the summable ideal $\{A\subseteq \mathbf{N}: \sum_{a \in A}1/a, Comment: 15 pages, comments are welcome

The classical theorem of Schnirelmann states that the primes are an additive basis for the integers. In this paper we consider the analogous multiplicative setting of the cyclic group $\left(\mathbb{Z}/ q\mathbb{Z}\right)^{\times}$, and prove a similar result. For all suitably large primes $q$ we define $P_\eta$ to be the set of primes less than $\eta q$, viewed naturally as a subset of $\left(\mathbb{Z}/ q\mathbb{Z}\right)^{\times}$. Considering the $k$-fold product set $P_\eta^{(k)}=\{p_1p_2\cdots p_k:p_i\in P_\eta \}$, we show that for $\eta \gg q^{-\frac{1}{4}+\epsilon}$ there exists a constant $k$ depending only on $\epsilon$ such that $P_\eta^{(k)}=\left(\mathbb{Z}/ q\mathbb{Z}\right)^{\times}$. Erd\H{o}s conjectured that for $\eta = 1$ the value $k=2$ should suffice: although we have not been able to prove this conjecture, we do establish that $P_1 ^{(2)}$ has density at least $\frac{1}{64}(1+o(1))$. We also formulate a similar theorem in almost-primes, improving on existing results., Comment: 10 pages + references. Small corrections in light of comments from referee. To appear in Bulletin of the London Mathematical Society

We prove a conjecture of the first author relating the Bernstein-Sato ideal of a finite collection of multivariate polynomials with cohomology support loci of rank one complex local systems. This generalizes a classical theorem of Malgrange and Kashiwara relating the b-function of a multivariate polynomial with the monodromy eigenvalues on the Milnor fibers cohomology., Comment: Final version, to appear in Inventiones Math

We classify finite non-solvable groups with a faithful primitive irreducible complex character that vanishes on a unique conjugacy class. Our results answer a question of Dixon and Rahnamai Barghi and suggest an extension of Burnside’s classical theorem on zeros of characters.

An undirected graph $G$ is $d$-degenerate if every subgraph of $G$ has a vertex of degree at most $d$. By the classical theorem of Erdös and Gallai from 1959, every graph of degeneracy $d>1$ contains a cycle of length at least $d+1$. The proof of Erdös and Gallai is constructive and can be turned into a polynomial time algorithm constructing a cycle of length at least $d+1$. But can we decide in polynomial time whether a graph contains a cycle of length at least $d+2$? An easy reduction from Hamiltonian Cycle provides a negative answer to this question: Deciding whether a graph has a cycle of length at least $d+2$ is NP-complete. Surprisingly, the complexity of the problem changes drastically when the input graph is 2-connected. In this case we prove that deciding whether $G$ contains a cycle of length at least $d+k$ can be done in time $2^{\mathcal{O}(k)}\cdot|V(G)|^{\mathcal{O}(1)}$. In other words, deciding whether a 2-connected $n$-vertex $G$ contains a cycle of length at least $d+\log{n}$ can be done in polynomial time. Similar algorithmic results hold for long paths in graphs. We observe that deciding whether a graph has a path of length at least $d+1$ is NP-complete. However, we prove that if graph $G$ is connected, then deciding whether $G$ contains a path of length at least $d+k$ can be done in time $2^{\mathcal{O}(k)}\cdot n^{\mathcal{O}(1)}$. We complement these results by showing that the choice of degeneracy as the “above guarantee parameterization” is optimal in the following sense: For any $\varepsilon>0$ it is NP-complete to decide whether a connected (2-connected) graph of degeneracy $d$ has a path (cycle) of length at least $(1+\varepsilon)d$. publishedVersion

We show that the decreasing rearrangement of the Fourier series with respect to the Jacobi polynomials for functions in L-p does not converge unless p = 2. As a by-product of our work on quasi-greedy bases in L-p(µ), we show that no normalized unconditional basis in L-p, p not equal 2, can be semi-normalized in L-q for q not equal p, thus extending a classical theorem of Kadets and Pelczynski from 1968. The first two authors were partially supported by the Spanish Research Grant Analisis Vectorial, Multilineal y Aplicaciones, reference number MTM2014-53009-P, and the last two authors were partially supported by the Spanish Research Grant Ortogonalidad, Teoria de la Aproximacion y Aplicaciones en Fisica Matematica, reference number MTM2015-65888-C4-4-P. The first-named author also acknowledges the support of Spanish Research Grant Operators, lattices, and structure of Banach spaces, with reference MTM2016-76808-P.

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct application of a classical theorem due to Bobkov and Gotze.