相关论文: New Bounds for the Integer Carath\'{e}odory Rank

This is a survey of the $cd$-index of Eulerian partially ordered sets. The $cd$-index is an encoding of the numbers of chains, specified by ranks, in the poset. It is the most efficient such encoding, incorporating all the affine relations…

For nonnegative integers $n$ and $d$, let $A(n,d)$ be the maximum cardinality of a binary code of length $n$ and minimum distance at least $d$. We consider a slight sharpening of the semidefinite programming bound of Gijswijt, Mittelmann…

Identifying and locating-dominating codes have been studied widely in circulant graphs of type $C_n(1,2,3,\dots, r)$ over the recent years. In 2013, Ghebleh and Niepel studied locating-dominating and identifying codes in the circulant…

The list-decodable code has been an active topic in theoretical computer science.There are general results about the list-decodability to the Johnson radius and the list-decoding capacity theorem. In this paper we show that rates,…

Cardinality estimation and conjunctive query evaluation are two of the most fundamental problems in database query processing. Recent work proposed, studied, and implemented a robust and practical information-theoretic cardinality…

For all $n$, we define the $n$-dimensional critical catenoid $M_n$ to be the unique rotationally symmetric, free boundary minimal hypersurface of non-trivial topology embedded in the closed unit ball in $\Bbb{R}^{n+1}$. We show that the…

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

A subset $\mathcal{S}$ of a conic $\mathcal{C}$ in the projective plane $\mathrm{PG}(2,q)$ is called almost complete (AC-subset for short) if it can be extended to a larger arc in $\mathrm{PG}(2,q)$ only by the points of…

Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87, and R(3,16) <= 98. All of them are improvements by one over…

We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\Sigma$ and integers $\Delta$ and $k$, determine the maximum order $N(\Delta,k,\Sigma)$ of a graph embeddable in $\Sigma$ with maximum degree…

Let $f(t, y,y')=\sum_{i=0}^d a_i(t, y)y'^i=0$ be a first order ordinary differential equation with polynomial coefficients. Eremenko in 1999 proved that there exists a constant $C$ such that every rational solution of $f(t, y,y')=0$ is of…

Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

In this paper, by using a combinatorial approach, we establish a new upper bound for the F-threshold $c^\mm(\mm)$ of determinantal rings generated by maximal minors. We prove that $c^\mm(\mm)$ coincides with the $a$-invariant in the case of…

We prove that the acyclic chromatic number of a graph with maximum degree $\Delta$ is less than $2.835\Delta^{4/3}+\Delta$. This improves the previous upper bound, which was $50\Delta^{4/3}$. To do so, we draw inspiration from works by…

Sequence representations supporting queries $access$, $select$ and $rank$ are at the core of many data structures. There is a considerable gap between the various upper bounds and the few lower bounds known for such representations, and how…

In this paper, we will establish the inequivalence of closed balls and the closure of open balls under the Carath\'{e}odory metric in some planar domains of finite connectivity greater than $2$, and hence resolve a problem posed by…

We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.

Constant-dimension codes (CDCs) have been investigated for noncoherent error correction in random network coding. The maximum cardinality of CDCs with given minimum distance and how to construct optimal CDCs are both open problems, although…

Consider an essentially nonbranching metric measure space with the measure contraction property of Ohta and Sturm, or with a Ricci curvature lower bound in the sense of Lott, Sturm and Villani. We prove a sharp upper bound on the inscribed…