相关论文: Gap Sequence of Cutting Sequence with Slope $\thet…
A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…
There exist two different sorts of gaps in the nonsymmetric numerical additive semigroups finitely generated by a minimal set of positive integers {d_1,...,d_m}. The h-gaps are specific only for the nonsymmetric semigroups while the g-gaps…
Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…
This paper is concerned with palindromes occurring in characteristic Sturmian words $c_\alpha$ of slope $\alpha$, where $\alpha \in (0,1)$ is an irrational. As $c_\alpha$ is a uniformly recurrent infinite word, any (palindromic) factor of…
We study the $\Gamma$-convergence of the following functional ($p>2$) $$ F_{\epsilon}(u):=\epsilon^{p-2}\int_{\Omega}|Du|^p d(x,\partial \Omega)^{a}dx+\frac{1}{\epsilon^{\frac{p-2}{p-1}}}\int_{\Omega}W(u) d(x,\partial…
It is well-known that numerically approximating calculus of variations problems possessing a Lavrentiev Gap Phenomenon (LGP) is challenging, and the standard numerical methodologies, such as finite element, finite difference, and…
Enumeration kernelization was first proposed by Creignou et al. [TOCS 2017] and was later refined by Golovach et al. [JCSS 2022] into two different variants: fully-polynomial enumeration kernelization and polynomial-delay enumeration…
In this paper, we study the pure $\kappa-$sparse gapsets and our focus on getting information about the sequence observed in Table 3 at [1], this sequence is listed in OEIS as A374773. We verify that the cardinality of the set of gapsets…
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…
Given a locally compact, complete metric space $({\rm X},{\sf D})$ and an open set $\Omega\subseteq{\rm X}$, we study the class of length distances $\sf d$ on $\Omega$ that are bounded from above and below by fixed multiples of the ambient…
A sequence is a fractal sequence if it contains itself as a proper subsequence. (The self-containment property resembles that of visual fractals) A doubly fractal sequence of integers is defined by operations called upper trimming and lower…
Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…
In this paper we study the diameter of Inhomogeneous random graphs $G(n,\kappa,p)$ that are induced by irreducible kernels $\kappa$. The kernels we consider act on separable metric spaces and are almost everywhere continuous. We generalize…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
It is by now well known that, at subleading power in scale ratios, factorization theorems for high-energy cross sections and decay amplitudes contain endpoint-divergent convolution integrals. The presence of these divergences hints at a…
Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…
We generalize the relation between discontinuities of scattering amplitudes and cut diagrams to cover sequential discontinuities (discontinuities of discontinuities) in arbitrary momentum channels. The new relations are derived using…
In this paper, we will introduce the `grid method' to prove that the extreme case of oscillation occurs for the averages obtained by sampling a flow along the sequence of times of the form $\{n^\alpha: n\in \mathbb{N}\}$, where $\alpha$ is…
Let $F=\{H_1,...,H_k\}$ be a family of graphs. A graph $G$ with $m$ edges is called {\em totally $F$-decomposable} if for {\em every} linear combination of the form $\alpha_1 e(H_1) + ... + \alpha_k e(H_k) = m$ where each $\alpha_i$ is a…
If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…