Related papers: A uniformly distributed parameter on a class of la…
We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^k poly(n,k)) time.
Suppose $G$ is a controllable graph of order $n$ with adjacency matrix $A$. Let $W=[e,Ae,\ldots,A^{n-1}e]$ ($e$ is the all-one vector) and $\Delta=\prod_{i>j}(\alpha_i-\alpha_j)^2$ ($\alpha_i$'s are eigenvalues of $A$) be the walk matrix…
The lower and the upper irredundance numbers of a graph $G$, denoted $ir(G)$ and $IR(G)$ respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a…
A path system $\mathscr{P}$ in a graph $G=(V,E)$ is a collection of paths, with exactly one path between any two vertices in $V$. A path system is said to be consistent if it is closed under subpaths. We say that a path system $\mathscr{P}$…
We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June…
A plane configuration {v_1,...,v_m} of vectors in {\mathbb R}^2 is said to be balanced if for any index i, the set of the det(v_i,v_j) for j\neq i is symmetric around the origin. A plane configuration is said to be uniform if every pair of…
In this paper, we focus on ordered $k$-flaw preference sets. Let $\mathcal{OP}_{n,\geq k}$ denote the set of ordered preference sets of length $n$ with at least $k$ flaws and $\mathcal{S}_{n,k}=\{(x_1,...,x_{n-k})\mid x_1+x_2+...…
What is the smallest number of random transpositions (meaning that we swap given pairs of elements with given probabilities) that we can make on an $n$-point set to ensure that each element is uniformly distributed -- in the sense that the…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
We study the 2-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…
We review some exact results for the motion of a tagged particle in simple models. Then, we study the density dependence of the self diffusion coefficient, $D_N(\rho)$, in lattice systems with simple symmetric exclusion in which the…
We define a deterministic integral with respect to irregular paths as a limit of standard line integrals and completely describe a class of all paths for which this integral exists for functions with H\"older exponent in the range of (0,1].…
We introduce a L\'evy-Lorentz gas in which a light particle is scattered by static point scatterers arranged on a line. We investigate the case where the intervals between scatterers $\{\xi_i \}$ are independent random variables identically…
Let $G_1$ and $G_2$ be two given graphs. The Ramsey number $R(G_1,G_2)$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_1$ or $\overline{G}$ contains a $G_2$. Parsons gave a recursive formula…
Path sets are spaces of one-sided infinite symbol sequences corresponding to the one-sided infinite walks beginning at a fixed initial vertex in a directed labeled graph. Path sets are a generalization of one-sided sofic shifts. This paper…
We begin our analysis with the study of two collections of lattice paths in the plane, denoted $\mathcal{D}_{[n,i,j]}$ and $\mathcal{P}_{[n,i,j]}$. These paths consist of sequences of $n$ steps, where each step allows movement in three…
Let $X_1,\ldots,X_n$ be an i.i.d. sample from symmetric stable distribution with stability parameter $\alpha$ and scale parameter $\gamma$. Let $\varphi_n$ be the empirical characteristic function. We prove an uniform large deviation…
Given a directed graph D = (N, A) and a sequence of positive integers 1 <= c_1 < c_2 < ... < c_m <= |N|, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality c_p for…
A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y=k…
The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences in the $d$-dimensional unit cube $[0,1]^d$. The figures of merit are three different variants of $L_2$ discrepancy. Theoretical results…