English
Related papers

Related papers: Conditional upper bounds on the least character no…

200 papers

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Combinatorics · Mathematics 2025-08-08 Vesa Kaarnioja , André-Alexander Zepernick

In this paper, we prove a lower bound for $\underset{\chi \neq \chi_0}{\max}\bigg|\sum_{n\leq x} \chi(n)\bigg|$, when $x= \frac{q}{(\log q)^B}$. This improves on a result of Granville and Soundararajan for large character sums when the…

Number Theory · Mathematics 2020-05-26 Crystel Bujold

A lower bound is derived for the boundary entropy s = ln g of a 1+1d quantum critical system with boundary, under the conditions that the bulk conformal central charge c is >=1 and the most relevant bulk scaling dimension is >(c-1)/12. This…

High Energy Physics - Theory · Physics 2015-06-05 Daniel Friedan , Anatoly Konechny , Cornelius Schmidt-Colinet

Several recent works in communication systems have proposed to leverage the power of neural networks in the design of encoders and decoders. In this approach, these blocks can be tailored to maximize the transmission rate based on…

Information Theory · Computer Science 2020-07-15 Sina Molavipour , Germán Bassi , Mikael Skoglund

Given a formal language L specified in various ways, we consider the problem of determining if L is nonempty. If L is indeed nonempty, we find upper and lower bounds on the length of the shortest string in L.

Formal Languages and Automata Theory · Computer Science 2011-03-22 Levent Alpoge , Thomas Ang , Luke Schaeffer , Jeffrey Shallit

We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance of such codes are derived. The upper bound is based on the…

Information Theory · Computer Science 2017-02-07 Stanislav Kruglik , Alexey Frolov

We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…

Information Theory · Computer Science 2016-11-18 Hugues Randriambololona

In this paper, we establishe the extremal bounds of the topological indices -- Sigma index -- focusing on analyzing the sharp upper bounds and the lower bounds of the Sigma index, which is known $\sigma(G)=\sum_{uv\in…

Combinatorics · Mathematics 2026-03-31 Jasem Hamoud , Duaa Abdullah

We obtained some upper bounds for the pseudocharacter of the space C(X,Y) at a point f.

General Topology · Mathematics 2014-06-27 Cetin Vural

We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for…

Information Theory · Computer Science 2016-02-10 Hui Zhang , Vitaly Skachek

Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.

Information Theory · Computer Science 2014-01-10 Alexey Frolov , Pavel Rybin

Two are the main objectives of this article: first, we introduce a method for determining and analyzing constrained local extrema that provides a different alternative to all previous works on the topic, by eliminating Lagrange multipliers…

Classical Analysis and ODEs · Mathematics 2013-03-14 Salvador Gigena

In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…

Number Theory · Mathematics 2024-04-09 Tanmoy Bera

Random fields in nature often have, to a good approximation, Gaussian characteristics. We present the mathematical framework for a new and simple method for investigating the non-Gaussian contributions, based on counting the maxima and…

Statistical Mechanics · Physics 2012-10-26 T. H. Beuman , A. M. Turner , V. Vitelli

Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.

Differential Geometry · Mathematics 2026-04-22 Allen Weitsman

A set of non-negative integers is an additive basis with range $n$, if its sumset covers all consecutive integers from 0 to $n$, but not $n+1$. If the range is exactly twice the largest element of the basis, the basis is restricted.…

Number Theory · Mathematics 2015-03-12 Jukka Kohonen

In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…

Combinatorics · Mathematics 2015-03-11 Michael Kiermaier , Alfred Wassermann

We obtain a Burgess-type bound for character sums over unions of intervals. The result follows from the argument of Heath-Brown, with an improvement in one of the steps.

Number Theory · Mathematics 2013-02-05 Xuancheng Shao

We derive explicit upper bounds for the Riemann zeta-function $\zeta(\sigma + it)$ on the lines $\sigma = 1 - k/(2^k - 2)$ for integer $k \ge 4$. This is used to show that the zeta-function has no zeroes in the region $$\sigma > 1 -…

Number Theory · Mathematics 2024-01-17 Andrew Yang

This paper is devoted to the problem of prescribing the scalar curvature under zero boundary conditions. Using dynamical and topological methods involving the study of critical points at infinity of the associated variational problem, we…

Analysis of PDEs · Mathematics 2007-05-23 Mohamed Ben Ayed , Khalil El Mehdi , Mohameden Ould Ahmedou
‹ Prev 1 3 4 5 6 7 10 Next ›