English
Related papers

Related papers: Examining $H$-Closed Ducci Sequences on $\mathbb{Z…

200 papers

This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szem\'eredi's Regularity Lemma plays a central role. We also investigate the robust outexpansion property for digraphs. Kelly showed that…

Combinatorics · Mathematics 2014-06-30 Amelia Taylor

We study the $\Gamma$-convergence of sequences of free-discontinuity functionals depending on vector-valued functions $u$ which can be discontinuous across hypersurfaces whose shape and location are not known a priori. The main novelty of…

Analysis of PDEs · Mathematics 2018-11-14 Filippo Cagnetti , Gianni Dal Maso , Lucia Scardia , Caterina Ida Zeppieri

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…

Combinatorics · Mathematics 2020-06-23 Michael Anastos , Alan Frieze

A covering of a digraph $D$ by Hamilton cycles is a collection of directed Hamilton cycles (not necessarily edge-disjoint) that together cover all the edges of $D$. We prove that for $1/2 \geq p\geq \frac{\log^{20} n}{n}$, the random…

Combinatorics · Mathematics 2024-10-18 Asaf Ferber , Marcelo Sales , Mason Shurman

Let $m$ be an odd positive integer and $D_m(\mathcal {A})$ be the $m$-periodic derived category of a finitary hereditary abelian category $\mathcal {A}$. In this note, we prove that there is an embedding of algebras from the derived Hall…

Representation Theory · Mathematics 2024-04-24 Haicheng Zhang , Xinran Zhang , Zhiwei Zhu

Suppose $\alpha$ is a rotationally symmetric norm on $L^{\infty}\left(\mathbb{T}\right) $ and $\beta$ is a "nice" norm on $L^{\infty}\left(\Omega,\mu \right) $ where $\mu$ is a $\sigma$-finite measure on $\Omega$. We prove a version of…

Functional Analysis · Mathematics 2014-08-07 Yanni Chen , Don Hadwin , Ye Zhang

We study the moduli space of handlebodies diffeomorphic to $(D^{n+1}\times S^{n})^{\natural g}$, i.e. the classifying space $BDiff((D^{n+1}\times S^n)^{\natural g}, D^{2n})$ of the group of diffeomorphisms that restrict to the identity near…

Algebraic Topology · Mathematics 2017-05-17 Boris Botvinnik , Nathan Perlmutter

We prove that every $3$-graph $H$ on $n$ vertices with minimum codegree $\delta_2(H) \geq 7n/9 + o(n)$ contains the square of a tight Hamilton cycle. This strengthens a theorem of Bedenknecht and Reiher that $\delta_2(H) \geq 4n/5 + o(n)$…

Combinatorics · Mathematics 2026-03-31 Debmalya Bandyopadhyay , Allan Lo , Richard Mycroft

The work deals with the qualification of semidiscrete hyperbolic type equations. We study a class of equations of the form $$\frac{du_{n+1}}{dx}=f\left(\frac{du_{n}}{dx},u_{n+1},u_{n}\right),$$ here the unknown function $u_n(x)$ depends on…

Exactly Solvable and Integrable Systems · Physics 2023-12-08 R. N. Garifullin

We study the signed Bernoulli convolution $$\nu_\beta^{(n)}=*_{j=1}^n \left (\frac12\delta_{\beta^{-j}}-\frac12\delta_{-\beta^{-j}}\right ),\ n\ge 1$$ where $\beta>1$ satisfies $$\beta^m=\beta^{m-1}+\cdots+\beta+1$$ for some integer $m\ge…

Classical Analysis and ODEs · Mathematics 2017-10-06 Xianghong Chen , Tian-You Hu

We show that the cycle relation between Dehn twists about curves in a circuit detects whether the circuit bounds an embedded disc. This is done by determining the isomorphism type of the group generated by said Dehn twists for various…

Geometric Topology · Mathematics 2023-04-27 Levi Ryffel

Let $(X,d,T )$ be a topological dynamical system with specification property. For $ \alpha\in \mathbb R^+$ and any $x_0\in X$, define $$ \mathbf D^{x_0}_\alpha :=\Big\{x\in X: \lim\limits_{\epsilon\to…

Dynamical Systems · Mathematics 2018-03-23 Cao Zhao , Ercai Chen

Subgraph and homomorphism counting are fundamental algorithmic problems. Given a constant-sized pattern graph $H$ and a large input graph $G$, we wish to count the number of $H$-homomorphisms/subgraphs in $G$. Given the massive sizes of…

Data Structures and Algorithms · Computer Science 2023-11-17 Daniel Paul-Pena , C. Seshadhri

Let $R = k[x_1, \ldots, x_n]$ be a polynomial ring over a field $k$ of characteristic zero and $\cR$ be the formal power series ring $k[[x_1, \ldots, x_n]]$. If $M$ is a $\D$-module over $R$, then $\cR \otimes_R M$ is naturally a…

Commutative Algebra · Mathematics 2018-08-29 Nicholas Switala , Wenliang Zhang

DNA graph has important contribution in completing the computational step of DNA sequencing process. Using $(\alpha,k)$-labeling, several families of digraphs have characterized as DNA graphs. Dicycles and dipaths are DNA graphs, rooted…

Combinatorics · Mathematics 2018-12-10 Inne Singgih

The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a…

Rings and Algebras · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is $O(n^3)$.

Data Structures and Algorithms · Computer Science 2007-06-20 Guohun Zhu

In this article we prove existence, uniqueness and regularity for the singular equation \begin{eqnarray*} \begin{cases} |\nabla u|^{\alpha}(F(D^{2}u)+h(x)\cdot\nabla u)+c(x)|u|^{\alpha}u+p(x)u^{-\gamma}=0 \ \mbox{ in } \ \Omega\\ u>0 \…

Analysis of PDEs · Mathematics 2022-08-25 Cheikhou Oumar Ndaw

For a finite alphabet $A$ define by $d_1(x,y):=\limsup_{n\to\infty}\frac{1}{2n+1}\#\{|i|\le n: x_i\neq y_i\}$ the Besicovitch pseudo-metric on $A^{\mathbb Z}$. It is well known that a closed subshift of $A^{\mathbb Z}$ has finite covering…

Dynamical Systems · Mathematics 2025-07-18 Stanisław Kasjan , Gerhard Keller

For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…

Combinatorics · Mathematics 2007-05-23 Noam D. Elkies
‹ Prev 1 8 9 10 Next ›