Search

We give an intrinsic characterisation of the separable reflexive Banach spaces that embed into separable reflexive spaces with an unconditional basis all of whose normalised block sequences with the same growth rate are equivalent. This uses methods of E. Odell and T. Schlumprecht. 1. THE SHIFT PROPERTY We consider in this paper a property of Schauder bases that has come up on sev- eral occasions since the first construction of a truly non-classical Banach space by B. S. Tsirelson in 1974 (11). It is a weakening of the property of perfect homogeneity, which replaces the condition all normalised block bases are equivalent with the weaker all normalised block bases with the same growth rate are equivalent, and is satisfied by bases constructed along the lines of the Tsirelson basis, including the standard bases for the Tsirelson space and its dual. To motivate our study and in order to fix ideas, in the following result we sum up a number of conditions that have been studied at various occasions in the literature and that can all be seen to be reformulations of the aforementioned property. Though I know of no single reference for the proof of the equivalence, parts of it are implicit in J. Lindenstrauss and L. Tzafriri's paper (7) and the paper by P. G. Casazza, W. B. Johnson and L. Tzafriri (2). Moreover, any idea needed for the proof can be found in

We give a new approach to the infinitesimal structure of Lipschitz maps into L^1. As a first application, we give an alternative proof of the main theorem from an earlier paper, that the Heisenberg group does not admit a bi-Lipschitz embedding in L^1. The proof uses the metric differentiation theorem of Pauls and the cut metric decomposition to reduce the nonembedding argument to a classification of monotone subsets of the Heisenberg group., Comment: Added a missing condition to Definition 5.3. Also made a number of minor corrections, and added a reference to a paper by Lee-Raghavendra

For a flnite group G let i(G) denote the graph deflned on the non- identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. In this paper it is shown that the graph i(G) contains a Hamiltonian cycle for many flnite groups G. In the literature many deep results about flnite simple groups G can equivalently be stated as theorems about i(G). Three examples are given. Guralnick and Shalev (10) showed that for su-ciently large G the graph i(G) has diameter at most 2. Guralnick and Kantor (9) showed that there is no isolated vertex in i(G). Finally, Breuer, Guralnick, Kantor (4) showed that the diameter of i(G) is at most 2 for all G. In this paper those flnite groups G are considered for which i(G) contains a Hamiltonian cycle. The following proposition reduces the investigations to those non-solvable groups G for which G=N is cyclic for any non-trivial normal subgroup N of G. Proposition 1.1. Let G be a flnite solvable group that has at least 4 elements. Then the graph i(G) contains a Hamiltonian cycle if and only if G=N is cyclic for all non-trivial normal subgroups N of G. The three main results of this paper are Theorems 1.2, 1.3, and 1.4.

Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. In particular, we are interested in interval and indifference graphs, which are important classes of intersection and Euclidean graphs, respectively. Interval graphs (with a very weak hypothesis) and indifference graphs are hyperbolic. In this paper, we give a sharp bound for their hyperbolicity constants. The main result in this paper is the study of the hyperbolicity constant of every interval graph with edges of length 1. Moreover, we obtain sharp estimates for the hyperbolicity constant of the complement of any interval graph with edges of length 1.

Doust and Weston introduced a new method called "enhanced negative type" for calculating a non trivial lower bound p(T) on the supremal strict p-negative type of any given finite metric tree (T,d). In the context of finite metric trees any such lower bound p(T) > 1 is deemed to be non trivial. In this paper we refine the technique of enhanced negative type and show how it may be applied more generally to any finite metric space (X,d) that is known to have strict p-negative type for some non negative p. This allows us to significantly improve the lower bounds on the supremal strict p-negative type of finite metric trees that were given by Doust and Weston and, moreover, leads in to one of our main results: The supremal p-negative type of a finite metric space cannot be strict. By way of application we are then able to exhibit large classes of finite metric spaces (such as finite isometric subspaces of Hadamard manifolds) that must have strict p-negative type for some p > 1. We also show that if a metric space (finite or otherwise) has p-negative type for some p > 0, then it must have strict q-negative type for all q in [0,p). This generalizes a well known theorem of Schoenberg and leads to a complete classification of the intervals on which a metric space may have strict p-negative type. (Several of the results in this paper hold more generally for semi-metric spaces.), 15 pages - this updated version of the said paper contains additional new theory. The paper is accepted for publication in the journal POSITIVITY

In this paper we consider a family of random Cantor sets on the line. We give some sufficient conditions when the Lebesgue measure of the arithmetic difference is positive. Combining this with the main result of a recent joint paper of the second author with M. Dekking we construct random Cantor sets F1, F2 such that the arithmetic difference set F2 − F1 does not contain any intervals but ℒeb(F2 − F1)> 0 almost surely, conditioned on non-extinction.

In his seminal papers, Koblitz proposed curves for cryptographic use. For fast operations on these curves, these papers also initiated a study of the radix-τ expansion of integers in the number fields and . The (window) nonadjacent form of τ -expansion of integers in was first investigated by Solinas. For integers in , the nonadjacent form and the window nonadjacent form of the τ -expansion were studied. These are used for efficient point multiplications on Koblitz curves. In this paper, we complete the picture by producing the (window) nonadjacent radix-τ expansions for integers in all Euclidean imaginary quadratic number fields.

The Farey series of order n, Fn, consists of all the fractions between 0 and 1 (inclusive) with denominators less than or equal to n, arranged in order of magnitude and expressed in their lowest terms, so that for example The most obvious way of computing one is to assign a long series of stores and then insert the terms with denominator 1, with denominator 2, … , shifting the terms already there to make room for the new ones in their correct positions. This may require a large amount of storage and is fairly slow because of the large amount of shifting involved: for instance F1025 has 319765 terms, and occupies 400 printed pages (see Neville [1]). Neville also gives a table related to F100, which has 3045 terms. His procedures, a heroic application of pencil-and-paper methods, are described at the end of this paper.

Let (X, O) be a germ of a normal surface singularity, π: → X be the minimal resolution of singularities and let A = (ai,j) be the n × n symmetrical intersection matrix of the exceptional set of In an old preprint Nash proves that the set of arcs on a surface singularity is a scheme , and defines a map from the set of irreducible components of to the set of exceptional components of the minimal resolution of singularities of (X,O). He proved that this map is injective and ask if it is surjective. In this paper we consider the canonical decomposition •For any couple (Ei,Ej) of distinct exceptional components, we define Numerical Nash condition (NN(i,j)). We have that (NN(i,j)) implies In this paper we prove that (NN(i,j)) is always true for at least the half of couples (i,j).•The condition (NN(i,j)) is true for all couples (i,j) with i ≠ j, characterizes a certain class of negative definite matrices, that we call Nash matrices. If A is a Nash matrix then the Nash map N is bijective. In particular our results depend only on A and not on the topological type of the exceptional set.•We recover and improve considerably almost all results known on this topic and our proofs are new and elementary.•We give infinitely many other classes of singularities where Nash Conjecture is true.The proofs are based on my old work [8] and in Plenat [10].

International audience; Computing the image of a regular language by the transitive closure of a relation is a central question in Regular Model Checking. In a recent paper Bouajjani, Muscholl and Touili \cite{Anca} proved that the class of regular languages L -- called APC -- of the form of a union of L{0,j}L{1,j}L{2,j}... L{k_j,j}$, where the union is finite and each L{i,j} is either a single symbol or a language of the form B* with B a subset of the alphabet, is closed under all semi-commutation relations R. Moreover a recursive algorithm on the regular expressions was given to compute R*(L). This paper provides a new approach, based on automata, for the same problem. Our approach produces a simpler and more efficient algorithm which furthermore works for a larger class of regular languages closed under union, intersection, semi-commutation relations and conjugacy. The existence of this new class, PolC, answers the open question proposed in the paper of Bouajjani and al.

Many papers study polynomial tractability for multivariate problems. Let n(@?,d) be the minimal number of information evaluations needed to reduce the initial error by a factor of @? for a multivariate problem defined on a space of d-variate functions. Here, the initial error is the minimal error that can be achieved without sampling the function. Polynomial tractability means that n(@?,d) is bounded by a polynomial in @?^-^1 and d and this holds for all (@?^-^1,d)@?[1,~)xN. In this paper we study generalized tractability by verifying when n(@?,d) can be bounded by a power of T(@?^-^1,d) for all (@?^-^1,d)@[email protected], where @W can be a proper subset of [1,~)xN. Here T is a tractability function, which is non-decreasing in both variables and grows slower than exponentially to infinity. In this article we consider the set @W=[1,~)x{1,2,...,d^*}@?[1,@?"0^-^1)xN for some d^*>=1 and @?"[email protected]?(0,1). We study linear tensor product problems for which we can compute arbitrary linear functionals as information evaluations. We present necessary and sufficient conditions on T such that generalized tractability holds for linear tensor product problems. We show a number of examples for which polynomial tractability does not hold but generalized tractability does.

The recent paper A Quantitative Doignon-Bell-Scarf Theorem by Aliev et al. [Combinatorica, 37 (2017), pp. 313--332] generalizes the famous Doignon--Bell--Scarf theorem on the existence of integer solutions to systems of linear inequalities. Their generalization examines the number of facets of a polyhedron that contains exactly $k$ integer points in ${R}^n$. They show that there exists a number $c(n,k)$ such that any polyhedron in $\mathbb{R}^n$ that contains exactly $k$ integer points has a relaxation to at most $c(n,k)$ of its inequalities that will define a new polyhedron with the same integer points. They prove that $c(n,k) = O(k)2^n$. In this paper, we improve the bound asymptotically to be sublinear in $k$, that is, $c(n,k) = o(k) 2^n$. We also provide lower bounds on $c(n,k)$, along with other structural results. For dimension n=2, our upper and lower bounds match to within a constant factor.

Let G be a finite group such that \(\mathop {{\text {SL}}}\nolimits (n,q)\subseteq G \subseteq \mathop {{\text {GL}}}\nolimits (n,q)\) and Z be a central subgroup of G. In this paper we determine the group T(G / Z) consisting of the equivalence classes of endotrivial k(G / Z)-modules where k is an algebraically closed field of characteristic p such that p does not divide q. The results in this paper complete the classification of endotrivial modules for all finite groups of (untwisted) Lie type A, initiated earlier by the authors.

In this paper, we give a description of polynomial functors from (finitely generated free) groups to abelian groups in terms of non-linear Mackey functors generalizing those given in a paper of Baues-Dreckmann-Franjou-Pirashvili published in 2001. This description is a consequence of our two main results: a description of functors from (fi nitely generated free) P-algebras (for P a set-operad) to abelian groups in terms of non-linear Mackey functors and the isomorphism between polynomial functors on (finitely generated free) monoids and those on (finitely generated free) groups. Polynomial functors from (finitely generated free) P-algebras to abelian groups and from (finitely generated free) groups to abelian groups are described explicitely by their cross-e ffects and maps relating them which satisfy a list of relations., Comment: 58 pages

$Hom(G,H)$ is a polyhedral complex defined for any two undirected graphs $G$ and $H$. This construction was introduced by Lov\'asz to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological properties of this class of complexes. We prove that $Hom(K_m,K_n)$ is homotopy equivalent to a wedge of $(n-m)$-dimensional spheres, and provide an enumeration formula for the number of the spheres. As a corollary we prove that if for some graph $G$, and integers $m\geq 2$ and $k\geq -1$, we have $\varpi_1^k(\thom(K_m,G))\neq 0$, then $\chi(G)\geq k+m$; here $Z_2$-action is induced by the swapping of two vertices in $K_m$, and $\varpi_1$ is the first Stiefel-Whitney class corresponding to this action. Furthermore, we prove that a fold in the first argument of $Hom(G,H)$ induces a homotopy equivalence. It then follows that $Hom(F,K_n)$ is homotopy equivalent to a direct product of $(n-2)$-dimensional spheres, while $Hom(\bar{F},K_n)$ is homotopy equivalent to a wedge of spheres, where $F$ is an arbitrary forest and $\bar{F}$ is its complement., Comment: This is the first part of the series of papers containing the complete proofs of the results announced in "Topological obstructions to graph colorings". This is the final version which is to appear in Israel J. Math., it has an updated list of references and new remarks on latest developments

Let X = (X1, X2, …, Xn) be an exchangeable random vector, and write X(1:i) = min{X1, X2, …, Xi}, 1 ≤ i ≤ n. In this paper we obtain conditions under which X(1:i) decreases in i in the hazard rate order. A result involving more general (that is, not necessarily exchangeable) random vectors is also derived. These results are applied to obtain the limiting behaviour of the hazard rate function of the lifetimes of various coherent systems in reliability theory. The notions of the Samaniego signatures and the minimal signatures of such systems are extensively used in the paper. An interesting relationship between these two signatures is obtained. The results are illustrated in a series of examples.

Andrei Andreevich Markov Jr. (born September 22, 1903, in St. Petersburg; died Oc tober 11, 1979, in Moscow) was the late and only child of the great Russian mathe matician Andrei Andreevich Markov Sr. (born June 14, 1856, in Ryazan7; died July 20, 1922, in Petrograd), universally recognized, in particular, for his contributions to the theory of probability (e.g., Markov chains and Markov processes). At his father's suggestion, young Andrei entered the chemistry section of the School of Physics and Mathematics at the University of Petrograd (formerly St. Petersburg, then Leningrad, and now again St. Petersburg). The young man was fascinated by chemistry and al ready by 1920 had taken part in chemical research. The results of his and his coau thor's work were published in 1924. Thus Markov's first paper dealt with chemistry. In his sophomore year he became interested in theoretical physics, and he graduated in 1924 with a physics degree. Markov's publications in chemistry were followed by a series of papers on the three body problem and dynamical systems (1926-1937), and a paper on Schr?dinger's quantum mechanics. The latter was one of the first papers on quantum mechanics published in the U.S.S.R., appearing less than a year after Schr?dinger's own ground breaking series of publications. In this connection it should be noted that it was Markov who, in 1931, introduced the concept of an abstract (topological) dynamical system. In 1932 Markov published an intriguing paper (in German) on relativity titled "Deriving a World Metric from the Relation 'Earlier Than.' " His interest in abstract mathematics is represented by series of papers on topology, algebra, analysis, and geometry. After World War II Markov's interests turned to axiomatic set theory, mathematical logic, and the foundations of mathematics. He founded the Russian school of con structive mathematics in the late 1940s and early 1950s. But in private conversations Markov often said that he had nurtured constructivist convictions for a very long time, in fact, long before the war. The Moscow mathematical school had been interested in constructivism, especially intuitionism, since its inception in the 1920s. It is enough to mention the 1925 work of Kolmogorov on intuitionistic logic [10]. It may be that this interest was due, at

An algebraic group of type E7 over an algebraically closed field has an irreducible representation in a vector space of dimension 56 and is, in fact, the identity component of the automorphism group of a quartic form on the space. This paper describes the construction of the quartic form if the characteristic is ≠ 2, 3, taking into account a field of definition F. Certain F-forms of E7 appear in the automorphism groups of quartic forms over F, as well as forms of E6. Many of the results of the paper are known, but are perhaps not easily accessible in the literature.

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that any graph is close to being the disjoint union of expanders. Our goal in this paper is to show that in several of the instantiations of the above approach, the quantitative bounds that were obtained are essentially best possible. Three examples of our results are the following: A classical result of Lipton, Rose and Tarjan from 1979 states that if F is a hereditary family of graphs and every graph in F has a vertex separator of size n/(log⁡n)1+o(1), then every graph in F has O(n) edges. We construct a hereditary family of graphs with vertex separators of size n/(log⁡n)1−o(1) such that not all graphs in the family have O(n) edges. Trevisan and Arora-Barak-Steurer have recently shown that given a graph G, one can remove only 1% of its edges to obtain a graph in which each connected component has good expansion properties. We show that in both of these decomposition results, the expansion properties they guarantee are essentially best possible, even when one is allowed to remove 99% of G's edges. Sudakov and the second author have recently shown that every graph with average degree d contains an n-vertex subgraph with average degree at least (1−o(1))d and vertex expansion 1/(log⁡n)1+o(1). We show that one cannot guarantee a better vertex expansion even if allowing the average degree to be O(1). The above results are obtained as corollaries of a new family of graphs which we construct in this paper. These graphs have a super-linear number of edges and nearly logarithmic girth, yet each of their subgraphs has (optimally) poor expansion properties.

We show new upper and lower bounds for the effective differential Nullstellensatz for differential fields of characteristic zero with several commuting derivations. Seidenberg was the first to address this problem in 1956, without giving a complete solution. In the case of one derivation, the first bound is due to Grigoriev in 1989. The first bounds in the general case appeared in 2009 in a paper by Golubitsky, Kondratieva, Szanto, and Ovchinnikov, with the upper bound expressed in terms of the Ackermann function. D'Alfonso, Jeronimo, and Solerno, using novel ideas, obtained in 2014 a new bound if restricted to the case of one derivation and constant coefficients. To obtain the bound in the present paper without this restriction, we extend this approach and use the new methods of Freitag and Leon Sanchez and of Pierce, which represent a model-theoretic approach to differential algebraic geometry.

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$ vertices of degree at least $(1+\alpha)k$ contains each tree $T$ of order $k$ as a subgraph. The method to prove our result follows a strategy similar to approaches that employ the Szemer\'edi regularity lemma: we decompose the graph $G$, find a suitable combinatorial structure inside the decomposition, and then embed the tree $T$ into $G$ using this structure. Since for sparse graphs $G$, the decomposition given by the regularity lemma is not helpful, we use a more general decomposition technique. We show that each graph can be decomposed into vertices of huge degree, regular pairs (in the sense of the regularity lemma), and two other objects each exhibiting certain expansion properties. In this paper, we introduce this novel decomposition technique. In the three follow-up papers, we find a combinatorial structure suitable inside the decomposition, which we then use for embedding the tree., Comment: 41 pages, 6 figures; further referees' comments incorporated, the most substantial of which being a newly written Section 3.8

We study in this paper very badly approximable matrix functions on the unit circle \( \mathbb{T}, \) i.e., matrix functions Φ such that the zero function is a superoptimal approximation of Φ. The purpose of this paper is to obtain a characterization of the continuous very badly approximable functions.

The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or intermediate, that is between polynomial and exponential. Despite recent spectacular progresses, the class of groups with intermediate growth remains largely mysterious. Many examples of such groups are constructed using Mealy automata. The aim of this paper is to give an algorithmic procedure to study the growth of such automaton groups, and more precisely to provide numerical upper bounds on their exponents. Our functions retrieve known optimal bounds on the famous first Grigorchuk group. They also improve known upper bounds on other automaton groups and permitted us to discover several new examples of automaton groups of intermediate growth. All the algorithms described are implemented in GAP, a language dedicated to computational group theory.

The test ideal $\tau(R)$ of a ring $R$ of prime characteristic is an important object in the theory of tight closure. In this paper, we study a generalization of the test ideal, which is the ideal $\tau(\a^t)$ associated to a given ideal $\a$ with rational exponent $t \ge 0$. We first prove a key lemma of this paper, which gives a characterization of the ideal $\tau(\a^t)$. As applications of this key lemma, we generalize the preceding results on the behavior of the test ideal $\tau(R)$. Moreover, we prove an analog of so-called Skoda's theorem, which is formulated algebraically via adjoint ideals by Lipman in his proof of the "modified Brian\c{c}on--Skoda theorem.", Comment: 11 pages, AMS-LaTeX; v.2: minor changes, to appear in Nagoya Math. J

The main problem that is solved in this paper has the following simple formulation (which is not used in its solution). The group K = Op(C) × Oq(C) acts on the space Mp, q of p × q complex matrices by (a; b) · x = axb–1, and so does its identity component K0 = SOp(C)×SOq(C). A K-orbit (or K0-orbit) in Mp,q is said to be nilpotent if its closure contains the zero matrix. The closure, , of a nilpotent K-orbit (resp. K0-orbit) in Mp,q is a union of and some nilpotent K-orbits (resp. K0-orbits) of smaller dimensions. The description of the closure of nilpotent K-orbits has been known for some time, but not so for the nilpotent K0-orbits. A conjecture describing the closure of nilpotent K0-orbits was proposed in [11] and verièd when min(p, q) ≤ 7. In this paper we prove the conjecture. The proof is based on a study of two prehomogeneous vector spaces attached to and determination of the basic relative invariants of these spaces.The above problem is equivalent to the problem of describing the closure of nilpotent orbits in the real Lie algebra so(p, q) under the adjoint action of the identity component of the real orthogonal group O(p, q).

In two seminal papers Kontsevich used a construction called graph homology as a bridge between certain infinite dimensional Lie algebras and various topological objects, includ- ing moduli spaces of curves, the group of outer automorphisms of a free group, and invariants of odd dimensional manifolds. In this paper, we show that Kontsevich's graph complexes, which include graph complexes studied earlier by Culler and Vogtmann and by Penner, have a rich algebraic structure. We define a Lie bracket and cobracket on graph complexes, and in fact show that they are Batalin-Vilkovisky algebras, and therefore Gerstenhaber algebras. We also find natural subcomplexes on which the bracket and cobracket are compatible as a Lie bialgebra. Kontsevich's graph complex construction was generalized to the context of operads by Ginzburg and Kapranov, with later generalizations by Getzler-Kapranov and Markl. In (CoV), we show that Kontsevich's results in fact extend to general cyclic operads. For some operads, including the examples associated to moduli space and outer automorphism groups of free groups, the subcomplex on which we have a Lie bi-algebra structure is quasi-isomorphic to the entire con- nected graph complex. In the present paper we show that all of the new algebraic operations canonically vanish when the homology functor is applied, and we expect that the resulting con- straints will be useful in studying the homology of the mapping class group, finite type manifold invariants and the homology of Out(F n).

In this paper, we study the classification of matrix GI/M/1-type Markov chains with a tree structure. We show that the Perron–Frobenius eigenvalue of a Jacobian matrix provides information for classifying these Markov chains. A fixed-point approach is utilized. A queueing application is presented to show the usefulness of the classification method developed in this paper.

The statement (and the proof) of Theorem 4.1.1 of the paper ‘Mackey formula in type A’ [Proc. London. Math. Soc. (3) 80 (2000) 545–574] is false. In this corrigendum we provide a correct statement (and a correct proof). As a consequence, we see that Corollary 4.1.2 of the paper holds. So all the other statements in the paper are correct (up to minor misprints…).2000 Mathematical Subject Classification: 20G05, 20G40.

We found these results to be quite intriguing and wondered if other means could be generated in this way by using different functions. As it turns out, this idea can be applied to a wide class of functions and the locations of the corresponding points c exhibit a surprising degree of simplicity and elegance. We will provide the details in this paper under the assumption that the reader has only a limited knowledge of the vast field of means. At the end of the paper, we will relate the means defined here to other types of means that have been considered in the literature. Given two distinct real numbers a and b, a mean M(a, b) is a number that lies between a and b. A mean is symmetric if M(a, b) = M(b, a) for all a and b. In this paper, we will only consider symmetric means defined for positive numbers. The most familiar example of a mean is the arithmetic mean (or average) of two numbers, but there are many more examples. For instance, the geometric mean of two positive numbers a and b is /a-b. This number is the side length of a square whose area is equal to that of a rectangle with lengths a and b. The value between a and b, often called c, whose existence is asserted by the Mean Value Theorem from differential calculus, also provides a way to define a mean of two numbers. As with the point of intersection of the tangent lines, a mean defined in this way depends on the function f. We will mention a connection between these two types of means.

Let (G, ρ, X) be a prehomogeneous vector space with singular set S over an algebraic number field F. The main result of this paper is a proof for the convergence of the zeta fucntions Z(Φ, s) associated with (G, ρ, X) for large Re s under the assumption that S is a hypersurface. This condition is satisfied if G is reductive and (G, ρ, X) is regular. When the connected component of the stabilizer of a generic point x is semisimple and the group Πx of connected components of Gx is abelian, a clear estimate of the domain of convergence is given.Moreover when S is a hypersurface and the Hasse principle holds for G, it is shown that the zeta fucntions are sums of (usually infinite) Euler products, the local components of which are orbital local zeta functions. This result has been proved in a previous paper by the author under the more restrictive condition that (G, ρ, X) is irreducible, regular, and reduced, and the zeta function is absolutely convergent.

Szemeredi's Regularity Lemma is a well-known and powerful tool in modern graph theory. This result led to a number of interesting applications, particularly in extremal graph theory. A regularity lemma for 3-uniform hypergraphs developed by Frankl and Rodl [8] allows some of the Szemeredi Regularity Lemma graph applications to be extended to hypergraphs. An important development regarding Szemeredi's Lemma showed the equivalence between the property of e-regularity of a bipartite graph G and an easily verifiable property concerning the neighborhoods of its vertices (Alon et al. [1]; cf. [6]). This characterization of e-regularity led to an algorithmic version of Szemeredi's lemma [1]. Similar problems were also considered for hypergraphs. In [2], [9], [13], and [18], various descriptions of quasi-randomness of k-uniform hypergraphs were given. As in [1], the goal of this paper is to find easily verifiable conditions for the hypergraph regularity provided by [8]. The hypergraph regularity of [8] renders quasi-random "blocks of hyperedges" which are very sparse. This situation leads to technical difficulties in its application. Moreover, as we show in this paper, some easily verifiable conditions analogous to those considered in [2] and [18] fail to be true in the setting of [8]. However, we are able to find some necessary and sufficient conditions for this hypergraph regularity. These conditions enable us to design an algorithmic version of a hypergraph regularity lemma in [8]. This algorithmic version is presented by the authors in [5].

This paper presents an algorithmic procedure to calculate the delay distribution of a type k customer in a first-come-first-served (FCFS) discrete-time queueing system with multiple types of customers, where each type has different service requirements (the MMAP[K]/PH[K]/1 queue). First, we develop a procedure, using matrix analytical methods, to handle arrival processes that do not allow batch arrivals to occur. Next, we show that this technique can be generalized to arrival processes that do allow batch arrivals to occur. We end the paper by presenting some numerical examples.

This paper is concerned with a finitely generated module M over a (commutative Noetherian) local ring R. In the case when R is a homomorphic image of a Gorenstein local ring, one can use the well-known associativity formula for multiplicities, together with local duality and Matlis duality, to produce analogous associativity formulae for the local cohomology modules of M with respect to the maximal ideal. The main purpose of this paper is to show that these formulae also hold in the case when R is universally catenary and such that all its formal fibres are Cohen–Macaulay.These formulae involve certain subsets of the spectrum of R called the pseudosupports of M; these pseudo-supports are closed in the Zariski topology when R is universally catenary and has the property that all its formal fibres are Cohen–Macaulay. However, examples are provided to show that, in general, these pseudo-supports need not be closed. We are able to conclude that the above-mentioned associativity formulae for local cohomology modules do not hold over all local rings.

Suppose [Formula: see text] is a finite field extension of [Formula: see text] containing a primitive [Formula: see text]th root of unity. Let [Formula: see text] be a maximal [Formula: see text]-extension of [Formula: see text] with the Galois group of period [Formula: see text] and nilpotent class [Formula: see text]. In this paper, we develop formalism which allows us to study the structure of [Formula: see text] via methods of Lie theory. In particular, we introduce an explicit construction of a Lie [Formula: see text]-algebra [Formula: see text] and an identification [Formula: see text], where [Formula: see text] is a [Formula: see text]-group obtained from the elements of [Formula: see text] via the Campbell–Hausdorff composition law. In the next paper, we apply this formalism to describe the ramification filtration [Formula: see text] and an explicit form of the Demushkin relation for [Formula: see text].

The question of a non-[Formula: see text]-type [Formula: see text] sequence wherein the fourth term shares the property [Formula: see text] with the first term has not been investigated so far. The present paper seeks to fill up the gap in this unexplored area. Let [Formula: see text] denote the set of all natural numbers and [Formula: see text] the sequence of Fibonacci numbers. Choose two integers [Formula: see text] and [Formula: see text] with [Formula: see text] such that their product increased by [Formula: see text] is a square [Formula: see text]. Certain properties of the sequence [Formula: see text] defined by the relation [Formula: see text] are established in this paper and polynomial expressions for Diophantine quadruples from the [Formula: see text] sequence [Formula: see text] are derived. The concept of a near-Diophantine quintuple is introduced and it is proved that there exist an infinite number of near-Diophantine quintuples.

In this paper we present several natural q-analogues of the poly-Bernoulli numbers arising in combinatorial contexts. We also recall some related analytical results and ask for combinatorial interpretations.

In recent years, researchers have studied the use of different iteration processes from fixed point theory in the generation of complex fractals. For instance, the Mann, Ishikawa, Noor, Jungck–Mann and Jungck–Ishikawa iterations have been used. In this paper, we study the use of the Picard–Mann iteration with s-convexity in the generation of Mandelbrot and Julia sets. We prove the escape criterion for the $$(k+1)$$ ( k + 1 ) st degree complex polynomial. Moreover, we present some graphical and numerical examples regarding Mandelbrot and Julia sets generated using the proposed iteration.

Following the work of Gaborit et al. (in: The international workshop on coding and cryptography (WCC 13), 2013) defining LRPC codes over finite fields, Renner et al. (in: IEEE international symposium on information theory, ISIT 2020, 2020) defined LRPC codes over the ring of integers modulo a prime power, inspired by the paper of Kamche and Mouaha (IEEE Trans Inf Theory 65(12):7718–7735, 2019) which explored rank metric codes over finite principal ideal rings. In this work, we successfully extend the work of Renner et al. by constructing LRPC codes over the ring $$\mathbb {Z}_{m}$$ Z m which is not a chain ring. We give a decoding algorithm and we study the failure probability of the decoder.

Consider a discrete-time supercritical branching random walk, which is a branching process combined with random spatial motion of particles, the number of the descendants tending to infinity with positive probability. Let $$ Z_n(\cdot ) $$ be the counting measure which counts the number of particles of generation n in a given set. Revesz (1994) studied the convergence rates in the central and local limit theorems for $$ Z_n(\cdot ) $$ in some special cases, and then, the topic was further developed in various cases. In this paper, we give the exact convergence rates of the central and local limit theorems for $$ Z_n(\cdot ) $$ in the case the underlying motion is governed by a general non-lattice random walk on $${\mathbb {R}}^d$$ with the characteristic function of the motion law satisfying the weak Cramer condition.

In this paper we consider several homological dimensions of crossed products $A _{\alpha} ^{\sigma} G$, where $A$ is a left Noetherian ring and $G$ is a finite group. We revisit the induction and restriction functors in derived categories, generalizing a few classical results for separable extensions. The global dimension and finitistic dimension of $A ^{\sigma} _{\alpha} G$ are classified: global dimension of $A ^{\sigma} _{\alpha} G$ is either infinity or equal to that of $A$, and finitistic dimension of $A ^{\sigma} _{\alpha} G$ coincides with that of $A$. A criterion for skew group rings to have finite global dimensions is deduced. Under the hypothesis that $A$ is a semiprimary algebra containing a complete set of primitive orthogonal idempotents closed under the action of a Sylow $p$-subgroup $S \leqslant G$, we show that $A$ and $A _{\alpha} ^{\sigma} G$ share the same homological dimensions under extra assumptions, extending the main results of the author in some previous papers., Comment: Proof simplified, typos and mistakes corrected. A big revision for induction and restriction by using theory of separable extensions

Data erasure can often occur in communication. Guarding against erasures involves redundancy in data representation. Mathematically this may be achieved by redundancy through the use of frames. One way to measure the robustness of a frame against erasures is to examine the worst case condition number of the frame with a certain number of vectors erased from the frame. The term numerically erasure-robust frames was introduced in Fickus and Mixon (Linear Algebra Appl 437:1394–1407, 2012) to give a more precise characterization of erasure robustness of frames. In the paper the authors established that random frames whose entries are drawn independently from the standard normal distribution can be robust against up to approximately 15 % erasures, and asked whether there exist frames that are robust against erasures of more than 50 %. In this paper we show that with very high probability random frames are, independent of the dimension, robust against erasures as long as the number of remaining vectors is at least \(1+\delta _0\) times the dimension for some \(\delta _0>0\). This is the best possible result, and it also implies that the proportion of erasures can be arbitrarily close to 1 while still maintaining robustness. Our result depends crucially on a new estimate for the smallest singular value of a rectangular random matrix with independent standard normal entries.

This paper studies closed 3-manifolds which are the attractors of a system of finitely many affine contractions that tile $\mathbb{R}^3$. Such attractors are called self-affine tiles. Effective characterization and recognition theorems for these 3-manifolds as well as theoretical generalizations of these results to higher dimensions are established. The methods developed build a bridge linking geometric topology with iterated function systems and their attractors. A method to model self-affine tiles by simple iterative systems is developed in order to study their topology. The model is functorial in the sense that there is an easily computable map that induces isomorphisms between the natural subdivisions of the attractor of the model and the self-affine tile. It has many beneficial qualities including ease of computation allowing one to determine topological properties of the attractor of the model such as connectedness and whether it is a manifold. The induced map between the attractor of the model and the self-affine tile is a quotient map and can be checked in certain cases to be monotone or cell-like. Deep theorems from geometric topology are applied to characterize and develop algorithms to recognize when a self-affine tile is a topological or generalized manifold in all dimensions. These new tools are used to check that several self-affine tiles in the literature are 3-balls. An example of a wild 3-dimensional self-affine tile is given whose boundary is a topological 2-sphere but which is not itself a 3-ball. The paper describes how any 3-dimensional handlebody can be given the structure of a self-affine 3-manifold. It is conjectured that every self-affine tile which is a manifold is a handlebody., 40 pages, 13 figures, 2 tables

In this paper, we consider the group Aut$(\mathbb{Q}, \leq)$ of order-automorphisms of the rational numbers, proving a result analogous to a theorem of Galvin's for the symmetric group. In an announcement, Kh\'elif states that every countable subset of Aut$(\mathbb{Q}, \leq)$ is contained in an $N$-generated subgroup of Aut$(\mathbb{Q}, \leq)$ for some fixed $N\in\mathbb{N}$. We show that the least such $N$ is $2$. Moreover, for every countable subset of Aut$(\mathbb{Q}, \leq)$, we show that every element can be given as a prescribed product of two generators without using their inverses. More precisely, suppose that $a$ and $b$ freely generate the free semigroup $\{a,b\}^+$ consisting of the non-empty words over $a$ and $b$. Then we show that there exists a sequence of words $w_1, w_2,\ldots$ over $\{a,b\}$ such that for every sequence $f_1, f_2, \ldots\in\,$Aut$(\mathbb{Q}, \leq)$ there is a homomorphism $\phi:\{a,b\}^{+}\to$ Aut$(\mathbb{Q},\leq)$ where $(w_i)\phi=f_i$ for every $i$. As a corollary to the main theorem in this paper, we obtain a result of Droste and Holland showing that the strong cofinality of Aut$(\mathbb{Q}, \leq)$ is uncountable, or equivalently that Aut$(\mathbb{Q}, \leq)$ has uncountable cofinality and Bergman's property., Comment: Updated to clarify some parts of the proof

In this paper we introduce the notion of an assembler, which formally encodes "cutting and pasting" data. An assembler has an associated $K$-theory spectrum, in which $\pi_0$ is the free abelian group of objects of the assembler modulo the cutting and pasting relations, and in which the higher homotopy groups encode further geometric invariants. The goal of this paper is to prove structural theorems about this $K$-theory spectrum, including analogs of Quillen's localization and d\'evissage theorems. We demonstrate the uses of these theorems by analysing the assembler associated to the Grothendieck ring of varieties and the assembler associated to scissors congruence groups of polytopes., Comment: 29 pages

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence. The expansions are finite sequences of nonnegative integer coefficients (satisfying certain technical conditions to guarantee uniqueness of the decomposition) and which can be viewed as analogs of sequences of variable-length words made from some fixed alphabet. In this paper we present a new approach and construction for uniform measures on expansions, identifying them as the distribution of a Markov chain conditioned not to hit a set. This gives a unified approach that allows us to easily recover results on the expansions from analogous results for Markov chains, and in this paper we focus on laws of large numbers, central limit theorems for sums of digits, and statements on gaps (zeros) in expansions. We expect the approach to prove useful in other similar contexts., Comment: Version 1.0, 25 pages. Keywords: Zeckendorf decompositions, positive linear recurrence relations, distribution of gaps, longest gap, Markov processes

In this paper we investigate the long-time behavior of stochastic reaction-diffusion equations of the type $du = (Au + f(u))dt + \sigma(u) dW(t)$, where $A$ is an elliptic operator, $f$ and $\sigma$ are nonlinear maps and $W$ is an infinite dimensional nuclear Wiener process. The emphasis is on unbounded domains. Under the assumption that the nonlinear function $f$ possesses certain dissipative properties, this equation is known to have a solution with an expectation value which is uniformly bounded in time. Together with some compactness property, the existence of such a solution implies the existence of an invariant measure which is an important step in establishing the ergodic behavior of the underlying physical system. In this paper we expand the existing classes of nonlinear functions $f$ and $\sigma$ and elliptic operators $A$ for which the invariant measure exists, in particular, in unbounded domains. We also show the uniqueness of the invariant measure for an equation defined on the upper half space if $A$ is the Shr\"{o}dinger-type operator $A = \frac{1}{\rho}(\text{div} \rho \nabla u)$ where $\rho = e^{-|x|^2}$ is the Gaussian weight., Comment: 25 pages

We study approximation of multivariate functions defined over Rd. We assume that all rth order partial derivatives of the functions considered are continuous and uniformly bounded. Approximation algorithms U(f) only use the values of f or its partial derivatives up to order r. We want to recover the function f with small error measured in a weighted Lq norm with a weight function ρ. We study the worst case (information) complexity which is equal to the minimal number of function and derivative evaluations needed to obtain error ε. We provide necessary and sufficient conditions in terms of the weight ρ and the parameters q and r for the weighted approximation problem to have finite complexity. We also provide conditions guaranteeing that the complexity is of the same order as the complexity of the classical approximation problem over a finite domain. Since the complexity of the weighted integration problem is equivalent to the complexity of the weighted approximation problem with q=1, the results of this paper also hold for weighted integration. This paper is a continuation of [7], where weighted approximation over R was studied.

The "similarity degree" of a unital operator algebra A was defined and studied in two recent papers of ours, where in particular we showed that it coincides with the "length" of an operator algebra. This paper brings several complements: we give direct proofs (with slight improvements) of several known facts on the length which were only known via the degree, and we show that the length of a type II1 factor with property Γ is at most 5, improving on a previous bound (≤ 44) due to E. Christensen.

WOS: 000389311800021, In [Finite presentability of Bruck-Reilly extensions of groups, J. Algebra 242 (2001) 2030], Araujo and RuAtic studied finite generation and finite presentability of Bruck Reilly extension of a group. In this paper, we aim to generalize some results given in that paper to generalized Bruck Reilly s -extension of a group. In this way, we determine necessary and sufficent conditions for generalized Bruck Reilly s-extension of a group, G R. (G; beta, gamma; u), to be finitely generated and finitely presented. Let G be a group, (3,-y: be morphisms and u is an element of H-1 (H-1(*) and H-1 are the ?-G- and ?-t-classes, respectively, contains the identity element kr of T). We prove that GE R* (G; 3, 7; u) is finitely generated if and only if there exists a finite subset Xo C G such that G is generated by ((boolean OR(i >= 0) X-0,beta(i))U(Uj >= 0X0 gamma(j)). We also prove that C superset of R.* (C; beta, gamma; u) is finitely presented if and only if G is presented by (X; R), where X is a finite set and R = (U i >= 0 R-0 beta(i)) boolean OR (U-j >= 0 R0 gamma(j)) = {w(1)beta(i) = upsilon(1)beta(i) : i >= 0, w(1) = v(1) is an element of H-1* for some finite set of relations R0 subset of X* x X*.

Doty and Giaquinto constructed a certain set denoted by [Formula: see text] in this paper, and conjectured that the set [Formula: see text] forms a [Formula: see text]-basis for the integral [Formula: see text]-Schur algebra [Formula: see text], where [Formula: see text]. In this paper, we show that the set [Formula: see text] is a [Formula: see text]-basis of [Formula: see text]-Schur algebra [Formula: see text] over [Formula: see text]. The set [Formula: see text] is a truncated form of PBW basis for quantum [Formula: see text]. Moreover, we give an example to show that the set [Formula: see text] is not [Formula: see text]-basis of [Formula: see text] in general.