English
Related papers

Related papers: New Bounds for the Integer Carath\'{e}odory Rank

200 papers

The main result of this paper is an improvement of the upper bound on the cardinal invariant ${\mathord{\mathrm{cov}}}^{\ast}({\mathcal{Z}}_{0})$ that was discovered by Raghavan and Shelah in an earlier paper. Here ${\mathcal{Z}}_{0}$ is…

Logic · Mathematics 2017-12-12 Dilip Raghavan

In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic…

Information Theory · Computer Science 2007-07-13 Maximilien Gadouleau , Zhiyuan Yan

We prove generalized lower Ricci bounds for Euclidean and spherical cones over complete Riemannian manifolds. These cones are regarded as complete metric measure spaces. In general, they will be neither manifolds nor Alexandrov spaces. We…

Differential Geometry · Mathematics 2011-03-02 Kathrin Bacher , Karl-Theodor Sturm

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

Discrete Mathematics · Computer Science 2025-06-17 Jamolidin K. Abdurakhmanov

We prove generalized lower Ricci bounds for Euclidean and spherical cones over compact Riemannian manifolds. These cones are regarded as complete metric measure spaces. We show that the Euclidean cone over an n-dimensional Riemannian…

Differential Geometry · Mathematics 2010-03-11 Kathrin Bacher , Karl-Theodor Sturm

The Carath\'eodory's Extension Theorem is a powerful tool that allows us to generate a measure, over a sigma-algebra, from a pre-measure defined over an algebra of sets. However, although this result reduces our work to define a measure by…

Probability · Mathematics 2024-07-08 Patrick Oliveira

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to…

Combinatorics · Mathematics 2018-06-12 Marc Noy , Lander Ramos

Let $\chi$ be a Dirichlet character modulo a prime~$p$. We give explicit upper bounds on $q_1<q_2<\dots<q_n$, the $n$ smallest prime nonresidues of $\chi$. More precisely, given $n_0$ and $p_0$ there exists an absolute constant…

Number Theory · Mathematics 2019-08-12 Shilin Ma , Kevin J. McGown , Devon Rhodes , Mathias Wanner

We present several novel encodings for cardinality constraints, which use fewer clauses than previous encodings and, more importantly, introduce new generally applicable techniques for constructing compact encodings. First, we present a CNF…

Computational Complexity · Computer Science 2026-04-20 Andrew Krapivin , Benjamin Przybocki , Bernardo Subercaseaux

We prove an Andr\'e--Oort-type result for a family of hypersurfaces in $\mathbb{C}^n$ that is both uniform and effective. Let $K_*$ denote the single exceptional imaginary quadratic field which occurs in the Siegel--Tatuzawa lower bound for…

Number Theory · Mathematics 2026-04-22 Guy Fowler

We show a nearly optimal lower bound on the length of linear relaxed locally decodable codes (RLDCs). Specifically, we prove that any $q$-query linear RLDC $C\colon \{0,1\}^k \to \{0,1\}^n$ must satisfy $n = k^{1+\Omega(1/q)}$. This bound…

Computational Complexity · Computer Science 2025-11-27 Guy Goldberg , Tom Gur , Sidhant Saraogi

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…

Combinatorics · Mathematics 2022-11-14 Florent Foucaud , Tuomo Lehtilä

We derive a bound on the conformal dimensions of the lightest few states in general unitary 2d conformal field theories with discrete spectra using modular invariance, including CFTs with chiral currents. We derive a bound on the conformal…

High Energy Physics - Theory · Physics 2015-08-04 Joshua D. Qualls

Estimating the cardinality of the output of a query is a fundamental problem in database query processing. In this article, we overview a recently published contribution that casts the cardinality estimation problem as linear optimization…

Databases · Computer Science 2025-05-13 Mahmoud Abo Khamis , Vasileios Nakos , Dan Olteanu , Dan Suciu

We extend the work of Hellerman (arxiv:0902.2790) to derive an upper bound on the conformal dimension $\Delta_2$ of the next-to-lowest nontrival primary operator in unitary two-dimensional conformal field theories without chiral primary…

High Energy Physics - Theory · Physics 2015-06-18 Joshua D. Qualls , Alfred D. Shapere

Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model, known as Cardinal Direction Calculus (CDC), for representing direction relations between…

Artificial Intelligence · Computer Science 2010-07-01 Xiaotong Zhang , Weiming Liu , Sanjiang Li , Mingsheng Ying

Let $\mathcal{O}_E$ be a complete discrete valuation ring and $R$ be a perfect ring in characteristic $p$, we also assume $R$ is a complete valuation ring whose valuation group is of rank one and non-discrete, we prove the Krull dimension…

Number Theory · Mathematics 2025-12-19 Heng Du

Bounding the number of rational points of height at most $H$ on irreducible algebraic plane curves of degree $d$ has been an intense topic of investigation since the work by Bombieri and Pila. In this paper we establish optimal dependence…

Number Theory · Mathematics 2023-09-21 Gal Binyamini , Raf Cluckers , Dmitry Novikov

Condorcet domains are sets of linear orders with the property that, whenever voters' preferences are restricted to the domain, the pairwise majority relation (for an odd number of voters) is transitive and hence a linear order. Determining…

Discrete Mathematics · Computer Science 2026-01-13 Alexander Karpov , Klas Markstrom , Soren Riis , Bei Zhou
‹ Prev 1 4 5 6 7 8 10 Next ›