Parity check matrices and product representations of squares

Let \(N_{\mathbb{F}} \)(n,k,r) denote the maximum number of columns in an n-row matrix with entries in a finite field \(\mathbb{F}\) in which each column has at most r nonzero entries and every k columns are linearly independent over \(\mathbb{F}\). We obtain near-optimal upper bounds for \(N_{\mathbb{F}} \)(n,k,r) in the case k > r. Namely, we show that \(N_\mathbb{F} (n,k,r) \ll n^{\frac{r}{2} + \frac{{cr}}{k}} \) where \(c \approx \frac{4}{3}\) for large k. Our method is based on a novel reduction of the problem to the extremal problem for cycles in graphs, and yields a fast algorithm for finding short linear dependencies. We present additional applications of this method to a problem on hypergraphs and a problem in combinatorial number theory.     

A Neighborhood Union Condition for Fractional ID-[<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">b</Emphasis>]-factor-critical Graphs

Let a, b, r be nonnegative integers with \(1\leq{a}\leq{b}\) and \(r\geq2\). Let G be a graph of order n with \(n >\frac{(a+2b)(r(a+b)-2)}{b}\). In this paper, we prove that G is fractional ID-[a, b]-factor-critical if \(\delta(G)\geq\frac{bn}{a+2b}+a(r-1)\) and \(\mid N_{G}(x_{1}) \cup N_{G}(x_{2}) \cup \cdotp \cdotp \cdotp \cup N_{G}(x_{r})\mid\geq\frac{(a+b)n}{a+2b}\) for any independent subset {x₁, x₂, · · ·, x_r} in G. It is a generalization of Zhou et al.’s previous result [Discussiones Mathematicae Graph Theory, 36: 409–418 (2016)] in which r = 2 is discussed. Furthermore, we show that this result is best possible in some sense.     

Eichler’s commutation relation and some other invariant subspaces of Hecke operators

Let k be an odd positive integer, L a lattice on a regular positive definite k-dimensional quadratic space over \(\mathbb {Q}\), \(N_L\) the level of L, and \(\mathscr {M}(L)\)  be the linear space of \(\theta \)-series attached to the distinct classes in the genus of L. We prove that, for an odd prime \(p|N_L\), if \(L_p=L_{p,1}\,\bot \, L_{p,2}\), where \(L_{p,1}\) is unimodular, \(L_{p,2}\) is (p)-modular, and \(\mathbb {Q}_pL_{p,2}\) is anisotropic, then \(\mathscr {M}(L;p):=\) \(\mathscr {M}(L)\) \(+T_{p^2}.\) \(\mathscr {M}(L)\)  is stable under the Hecke operator \(T_{p^2}\). If \(L_2\) is isometric to \(\left( \begin{array}{ll}0&{}\frac{1}{2}\\ \frac{1}{2}&{}0\end{array}\right) ^{\kappa }\,\bot \, \langle \varepsilon \rangle \) or \(\left( \begin{array}{ll}0&{}\frac{1}{2}\\ \frac{1}{2}&{}0\end{array}\right) ^{\kappa }\,\bot \, \langle 2\varepsilon \rangle \) or \(\left( \begin{array}{ll}0&{}1\\ 1&{}0\end{array}\right) ^{\kappa }\,\bot \, \langle \varepsilon \rangle \) with \(\varepsilon \in \mathbb {Z}_2^{\times }\) and \(\kappa :=\frac{k-1}{2}\), then \(\mathscr {M}(L;2):=T_{2^2}.\mathscr {M}(L)+T_{2^2}^2.\,\mathscr {M}(L)\) is stable under the Hecke operator \(T_{2^2}\). Furthermore, we determine some invariant subspaces of the cusp forms for the Hecke operators.     

Power Laws Variance Scaling of Boolean Random Varieties

Long fibers or stratified media show very long range correlations. These media can be simulated by models of Boolean random varieties and their iteration. They show non standard scaling laws with respect to the volume of domains K for the variance of the local volume fraction: on a large scale, the variance of the local volume fraction decreases according to power laws of the volume of K. The exponent γ is equal to \(\frac {n-k}{n}\) for Boolean varieties with dimension k in the space \( \mathbb {R}^{n}\): \(\gamma =\frac {2}{3}\) for Boolean fibers in 3D, and \(\gamma =\frac {1}{3}\) for Boolean strata in 3D. When working in 2D, the scaling exponent of Boolean fibers is equal to \(\frac {1}{2}\). From the results of numerical simulations, these scaling laws are expected to hold for the prediction of the effective properties of such random media.     

Stable CLTs and Rates for Power Variation of <Emphasis Type="Italic">α</Emphasis>-Stable Lévy Processes

In a central limit type result it has been shown that the pth power variations of an α-stable Lévy process along sequences of equidistant partitions of a given time interval have \(\frac{\alpha}{p}\)-stable limits. In this paper we give precise orders of convergence for the distances of the approximate power variations computed for partitions with mesh of order \(\frac{1}{n}\) and the limiting law, measured in terms of the Kolmogorov-Smirnov metric. In case 2α?<?p the convergence rate is seen to be of order \(\frac{1}{n}\), in case α?<?p?<?2α the order is \(n^{1-\frac{p}{\alpha}}.\)     

Two families of Niho sequences having four-valued cross correlation with <Emphasis Type="Italic">m</Emphasis>-sequences

For two odd integers m and s with 1 ≤ s < m and gcd(m ; s ) = 1, let h satisfy h (2^s ? 1) ≡ 1 (mod 2^m + 1) and d = (h + 1)(2^m ? 1) + 1. The cross correlation function between a binary m-sequence of period 2^2m ? 1 and its d-decimation sequence is proved to take four values, and the correlation distribution is completely determined. Let n be an even integer and k be an integer with \(1 \leqslant k \leqslant \frac{n}{2}\). For an odd prime p and a p-ary m-sequence {s(t)} of period pn ? 1, define u(t) = \(\sum \begin{array}{*{20}{c}}{\frac{{{p^k} - 1}}{2}} \\ {i = 0} \end{array}\) s(dit), where di = \(i{p^{\frac{n}{2}}} + {p^k} - i\) ? i and i = 0,1,..., \(\frac{{{p^k} - 1}}{2}\). It is proved that the cross correlation function between {u(t)} and {s(t)} is three-valued or four-valued depending on whether k is equal to \(\frac{n}{2}\) or not, and the distribution is also determined.     

Map determined by rank-$$\varvec{}$$ matrice for relatively mall $$\varvec{}$$

Let n and s be integers such that \(1\le s<\frac{n}{2}\), and let \(M_n(\mathbb {K})\) be the ring of all \(n\times n\) matrices over a field \(\mathbb {K}\). Denote by \([\frac{n}{s}]\) the least integer m with \(m\ge \frac{n}{s}\). In this short note, it is proved that if \(g:M_n(\mathbb {K})\rightarrow M_n(\mathbb {K})\) is a map such that \(g\left( \sum _{i=1}^{[\frac{n}{s}]}A_i\right) =\sum _{i=1}^{[\frac{n}{s}]}g(A_i)\) holds for any \([\frac{n}{s}]\) rank-s matrices \(A_1,\ldots ,A_{[\frac{n}{s}]}\in M_n(\mathbb {K})\), then \(g(x)=f(x)+g(0)\), \(x\in M_n(\mathbb {K})\), for some additive map \(f:M_n(\mathbb {K})\rightarrow M_n(\mathbb {K})\). Particularly, g is additive if \(char\mathbb {K}\not \mid \left( [\frac{n}{s}]-1\right) \).     

An asymptotic formula for the primitive of Hardy’s function

Let Z(t) be the classical Hardy function in the theory of Riemann’s zeta-function. An asymptotic formula with an error term O(T ^1/6log?T) is given for the integral of Z(t) over the interval [0,T], with special attention paid to the critical cases when the fractional part of \(\sqrt{T/2\pi }\) is close to \(\frac{1}{4}\) or \(\frac{3}{4}\).     

Single and Double Layer Potentials on Domains with Conical Points I: Straight Cones

Let \({\Omega = \mathbb{R}^+ \omega}\) be an open straight cone in \({\mathbb{R}^n, n\geq3}\) , where \({\omega \subset S^{n-1}}\) is a smooth subdomain of the unit sphere. Denote by K and S the double and single layer potential operators associated to Ω and the Laplace operator Δ. Let r be the distance to the origin. We consider a natural class of dilation invariant operators on ?Ω, called Mellin convolution operators and show that \({K_a :=r^{a}Kr^{-a}}\) and \({S_b := r^{b-\frac{1}{2}}Sr^{-b-\frac{1}{2}}}\) are Mellin convolution operators for \({a \in (-1, n-1)}\) and \({b \in (\frac{1}{2}, n-\frac{3}{2})}\) . It is known that a Mellin convolution operator T is invertible if, and only if, its Mellin transform \({\hat T( \lambda)}\) is invertible for any real λ. We establish a reduction procedure that relates the Mellin transforms of K _a and S _b to the single and, respectively, double layer potential operators associated to some other elliptic operators on ω, which can be shown to be invertible using the classical theory of layer potential operators on smooth domains. This reduction procedure thus allows us to prove that \({\frac{1}{2}\pm K}\) and S are invertible between suitable weighted Sobolev spaces. A classical consequence of the invertibility of these operators is a solvability result in weighted Sobolev spaces for the Dirichlet problem on Ω.     

Dichotomy for the Hausdorff dimension of the set of nonergodic directions

Given an irrational 0<λ<1, we consider billiards in the table P _λ formed by a \(\tfrac{1}{2}\times1\) rectangle with a horizontal barrier of length \(\frac{1-\lambda}{2}\) with one end touching at the midpoint of a vertical side. Let NE?(P _λ ) be the set of θ such that the flow on P _λ in direction θ is not ergodic. We show that the Hausdorff dimension of NE?(P _λ ) can only take on the values 0 and \(\tfrac{1}{2}\), depending on the summability of the series \(\sum_{k}\frac{\log\log q_{k+1}}{q_{k}}\) where {q _k } is the sequence of denominators of the continued fraction expansion of λ. More specifically, we prove that the Hausdorff dimension is \(\frac{1}{2}\) if this series converges, and 0 otherwise. This extends earlier results of Boshernitzan and Cheung.     

Induced Cycles in Graphs

The maximum number vertices of a graph G inducing a 2-regular subgraph of G is denoted by \(c_\mathrm{ind}(G)\). We prove that if G is an r-regular graph of order n, then \(c_\mathrm{ind}(G) \ge \frac{n}{2(r-1)} + \frac{1}{(r-1)(r-2)}\) and we prove that if G is a cubic, claw-free graph on order n, then \(c_\mathrm{ind}(G) > \frac{13}{20}n\) and this bound is asymptotically best possible.     

Numerical semigroups whose fractions are of maximal embedding dimension

Each saturated (resp., Arf) numerical semigroup S has the property that each of its fractions \(\frac{S}{k}\) is saturated (resp., Arf), but the property of being of maximal embedding dimension (MED) is not stable under formation of fractions. If S is a numerical semigroup, then S is MED (resp., Arf; resp., saturated) if and only if, for each 2≤k∈?, \(S = \frac{T}{k}\) for infinitely many MED (resp., Arf; resp., saturated) numerical semigroups T. Let \(\mathcal{A}\) (resp., \(\mathcal{F}\)) be the class of Arf numerical semigroups (resp., of numerical semigroups each of whose fractions is of maximal embedding dimension). Then there exists an infinite strictly ascending chain \(\mathcal{A} =\mathcal{C}_{1} \subset\mathcal{C}_{2} \subset\mathcal{C}_{3}\subset \,\cdots\, \subset\mathcal{F}\), where, like \(\mathcal{A}\) and \(\mathcal{F}\), each \(\mathcal{C}_{n}\) is stable under the formation of fractions.     

Construction of sign-changing solutions for a harmonic equation with subcritical exponent

In this paper, we study the harmonic equation involving subcritical exponent \((P_{\varepsilon })\): \( \Delta u = 0 \), in \(\mathbb {B}^n\) and \(\displaystyle \frac{\partial u}{\partial \nu } + \displaystyle \frac{n-2}{2}u = \displaystyle \frac{n-2}{2} K u^{\frac{n}{n-2}-\varepsilon }\) on \( \mathbb {S}^{n-1}\) where \(\mathbb {B}^n \) is the unit ball in \(\mathbb {R}^n\), \(n\ge 5\) with Euclidean metric \(g_0\), \(\partial \mathbb {B}^n = \mathbb {S}^{n-1}\) is its boundary, K is a function on \(\mathbb {S}^{n-1}\) and \(\varepsilon \) is a small positive parameter. We construct solutions of the subcritical equation \((P_{\varepsilon })\) which blow up at two different critical points of K. Furthermore, we construct solutions of \((P_{\varepsilon })\) which have two bubbles and blow up at the same critical point of K.     

A note on almost difference sets in nonabelian groups

We present a new construction of almost difference sets. The construction occurs in nonabelian groups of order 4N with a subgroup H of order N so that H has an (N,\(\frac{N-1}{2}\),\(\frac{N-3}{4}\)) difference set (and hence N must be an integer that is 3 (mod 4)).     

On the Number of Ordinary Circles Determined by <Emphasis Type="Italic">n</Emphasis> Points

In this paper we deal with the following problem: Given a set B consisting of n points, not all on a line or a circle. A circle passes through exactly three points of B is called an ordinary circle. What is the minimal possible number of ordinary circles determined by B? In this paper we improve the best-known lower bound \(\frac{22}{247}{n\choose2}\) to \(\frac{1}{9}{n\choose2}\).     

Morrey Spaces on Domains: Different Approaches and Growth Envelopes

We deal with Morrey spaces on bounded domains \(\Omega \) obtained by different approaches. In particular, we consider three settings \(\mathcal {M}_{u,p}(\Omega )\), \(\mathbb {M}_{u,p}(\Omega )\) and \(\mathfrak {M}_{u,p}(\Omega )\), where \(0<p\le u<\infty \), commonly used in the literature, and study their connections and diversities. Moreover, we determine the growth envelopes \(\mathfrak {E}_{\mathsf {G}}(\mathcal {M}_{u,p}(\Omega ))\) as well as \(\mathfrak {E}_{\mathsf {G}}(\mathfrak {M}_{u,p}(\Omega ))\), and obtain some applications in terms of optimal embeddings. Surprisingly, it turns out that the interplay between p and u in the sense of whether \(\frac{n}{u}\ge \frac{1}{p}\) or \(\frac{n}{u} < \frac{1}{p}\) plays a decisive role when it comes to the behaviour of these spaces.     

A Comment on Ryser’s Conjecture for Intersecting Hypergraphs

Let \(\tau({\mathcal{H}})\) be the cover number and \(\nu({\mathcal{H}})\) be the matching number of a hypergraph \({\mathcal{H}}\). Ryser conjectured that every r-partite hypergraph \({\mathcal{H}}\) satisfies the inequality \(\tau({\mathcal{H}}) \leq (r-1) \nu ({\mathcal{H}})\). This conjecture is open for all r ≥ 4. For intersecting hypergraphs, namely those with \(\nu({\mathcal{H}}) = 1\), Ryser’s conjecture reduces to \(\tau({\mathcal{H}}) \leq r-1\). Even this conjecture is extremely difficult and is open for all r ≥ 6. For infinitely many r there are examples of intersecting r-partite hypergraphs with \(\tau({\mathcal{H}}) = r-1\), demonstrating the tightness of the conjecture for such r. However, all previously known constructions are not optimal as they use far too many edges. How sparse can an intersecting r-partite hypergraph be, given that its cover number is as large as possible, namely \(\tau({\mathcal{H}}) \ge r-1\)? In this paper we solve this question for r ≤ 5, give an almost optimal construction for r = 6, prove that any r-partite intersecting hypergraph with τ(H) ≥ r ? 1 must have at least \((3-\frac{1}{\sqrt{18}})r(1-o(1)) \approx 2.764r(1-o(1))\) edges, and conjecture that there exist constructions with Θ(r) edges.     

Some Estimates of Higher Order Riesz Transform Related to Schrödinger Type Operators

In this paper we consider the Schrödinger type operators \(H_2=(-\Delta)^2 +V^2\), where the nonnegative potential V belongs to the reverse Hölder class \(B_{q_{_1}}\) for \(q_{_1}\geq \frac{n}{2}, n\geq 5\). The L ^p and weak type (1, 1) estimates of higher order Riesz transform \(\nabla^2H^{-\frac{1}{2}}_2 \) related to Schrödinger type operators H ₂ are obtained. In particular, \(\nabla^2H^{-\frac{1}{2}}_2 \) is a Calderón-Zygmund operator if V?∈?B _2n or \(V\in B_\frac{n}{2}\) and there exists a constant C such that V(x)?≤?Cm(x,V)².     

Edge Roman Domination on Graphs

An edge Roman dominating function of a graph G is a function \(f:E(G) \rightarrow \{0,1,2\}\) satisfying the condition that every edge e with \(f(e)=0\) is adjacent to some edge \(e'\) with \(f(e')=2\). The edge Roman domination number of G, denoted by \(\gamma '_R(G)\), is the minimum weight \(w(f) = \sum _{e\in E(G)} f(e)\) of an edge Roman dominating function f of G. This paper disproves a conjecture of Akbari, Ehsani, Ghajar, Jalaly Khalilabadi and Sadeghian Sadeghabad stating that if G is a graph of maximum degree \(\Delta \) on n vertices, then \(\gamma _R'(G) \le \lceil \frac{\Delta }{\Delta +1} n \rceil \). While the counterexamples having the edge Roman domination numbers \(\frac{2\Delta -2}{2\Delta -1} n\), we prove that \(\frac{2\Delta -2}{2\Delta -1} n + \frac{2}{2\Delta -1}\) is an upper bound for connected graphs. Furthermore, we provide an upper bound for the edge Roman domination number of k-degenerate graphs, which generalizes results of Akbari, Ehsani, Ghajar, Jalaly Khalilabadi and Sadeghian Sadeghabad. We also prove a sharp upper bound for subcubic graphs. In addition, we prove that the edge Roman domination numbers of planar graphs on n vertices is at most \(\frac{6}{7}n\), which confirms a conjecture of Akbari and Qajar. We also show an upper bound for graphs of girth at least five that is 2-cell embeddable in surfaces of small genus. Finally, we prove an upper bound for graphs that do not contain \(K_{2,3}\) as a subdivision, which generalizes a result of Akbari and Qajar on outerplanar graphs.     

Fujita type conditions to heat equation with variable source

This paper studies heat equation with variable exponent u _t = Δu + u^p(x) + u ^q in ? ^N × (0, T), where p(x) is a nonnegative continuous, bounded function, 0 < p_? = inf p(x) ≤ p(x) ≤ sup p(x) = p₊. It is easy to understand for the problem that all nontrivial nonnegative solutions must be global if and only if max {p₊, q} ≤ 1. Based on the interaction between the two sources with fixed and variable exponents in the model, some Fujita type conditions are determined that that all nontrivial nonnegative solutions blow up in finite time if 0 < q ≤ 1 with p₊ > 1, or 1 < q < 1 + \(\frac{2}{N}\). In addition, if q > 1 + \(\frac{2}{N}\), then (i) all solutions blow up in finite time with 0 < p_? ≤ p₊ ≤ 1 + \(\frac{2}{N}\); (ii) there are both global and nonglobal solutions for p_? > 1 + \(\frac{2}{N}\); and (iii) there are functions p(x) such that all solutions blow up in finite time, and also functions p(x) such that the problem possesses global solutions when p_? < 1 + \(\frac{2}{N}\) < p₊.