Related papers: Multi-Secant Lemma

It is known that not only classical semantics but also intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth tables, or truth functions. In our previous work, it…

Multilingual fact verification requires evidence that is both relevant and sufficiently complete for reliable factuality prediction. However, existing systems often rely on search snippets, sentence-level evidence, or locally segmented…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the…

Let $k$ be a field, $V$ be a $k$-vector space and $X\subset V$ an algebraic irreducible subvariety. We say that a function $f:X(k) \to k$ is weakly linear if its restriction to any two-dimensional linear subspace $W$ of $V$ contained in $X$…

A \emph{stacked triangulation} of a $d$-simplex $\mathbf{o}=\{1,\ldots,d+1\}$ ($d\geq 2$) is a triangulation obtained by repeatedly subdividing a $d$-simplex into $d+1$ new ones via a new vertex (the case $d=2$ is known as an Appolonian…

The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…

Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…

Let $G$ be a linear algebraic group over an infinite field $k$. Loosely speaking, a $G$-torsor over $k$-variety is said to be versal if it specializes to every $G$-torsor over any $k$-field. The existence of versal torsors is well-known. We…

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than…

Bennett, Hart, Iosevich, Pakianathan, and Rudnev found an exponent $s<d$ such that any set $E\subset \mathbb{F}_q^d$ with $|E|\gtrsim q^s$ determines $\gtrsim q^{\binom{k+1}{2}}$ congruence classes of $(k+1)$-point configurations for $k\leq…

The $k$-expansion of a graph $G$ is the $k$-uniform hypergraph obtained from $G$ by adding $k-2$ new vertices to every edge. We determine, for all $k > d \geq 1$, asymptotically optimal $d$-degree conditions that ensure the existence of all…

We prove the existence of defective secant varieties of three-factor and four-factor Segre-Veronese varieties embedded in certain multi-degree. These defective secant varieties were previously unknown and are of importance in the…

We classify linearly normal surfaces $S \subset \mathbf{P}^{r+1}$ of degree $d$ such that $4g-4 \leq d \leq 4g+4$, where $g>1$ is the sectional genus (it is a classical result that for larger $d$ there are only cones). We apply this to the…

The physics of $k$-core percolation pertains to those systems whose constituents require a minimum number of $k$ connections to each other in order to participate in any clustering phenomenon. Examples of such a phenomenon range from…

Let $X_{m,d}\subset \mathbb {P}^N$, $N:= \binom{m+d}{m}-1$, be the order $d$ Veronese embedding of $\mathbb {P}^m$. Let $\tau (X_{m,d})\subset \mathbb {P}^N$, be the tangent developable of $X_{m,d}$. For each integer $t \ge 2$ let $\tau…

We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…

We construct a novel invariant of braids and knots, secant-quandle (SQ),with generic secants serving as generators and generic horizontal trisecants serving as relations, i.e., $SQ = \Gamma \left< \mathcal{S}_M\mid…

An $r$-uniform hypergraphic sequence (i.e., $r$-graphic sequence) $d=(d_1, d_2,\cdots,d_n)$ is said to be forcibly $k$-edge-connected if every realization of $d$ is $k$-edge-connected. In this paper, we obtain a strongest sufficient degree…

Let X be a smooth hypersurface of degree d in P^n over an algebraically closed field of characteristic p. We show that X must be separably rationally connected and must contain a free line if either p is at least d or if p is at least d-1…