4,153 results for prove (0.164 seconds)

arxiv.org/abs/1204.1598v1

Improving Seek Time for Column Store Using MMH Algorithm

Hash based search has, proven excellence on large data warehouses stored in column store. Data distribution has significant impact on hash based search. To reduce impact of data distribution, we have proposed Memory Managed Hash (MMH) algorithm that...

arxiv.org/abs/1205.0676v4

Effective representations of Hecke-Kiselman monoids of type A

We prove effectiveness of certain representations of Hecke-Kiselman monoids of type A constructed by Ganyushkin and Mazorchuk and also construct further classes of effective representations for these monoids. As a consequence the effective dimension...

arxiv.org/abs/1602.04411v5

Stochastic orders and the frog model

The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove that certain...

arxiv.org/abs/1505.05006v2

The speed of frogs with drift on $\mathbb{Z}$

In this article we consider the frog model with drift on $\mathbb{Z}$ and investigate the behaviour of the cloud of the frogs. In particular, we show that the speed of the minimum equals the speed of a single frog and prove some properties of the spe...

arxiv.org/abs/2204.00509v1

Relative quantum cohomology under birational transformations

We study how relative quantum cohomology, defined by Tseng--You and Fan--Wu--You, varies under birational transformations. For toric complete intersections with simple normal crossings divisors that contain the loci of indeterminacy, we prove that th...

arxiv.org/abs/cs/9911013v1

PushPush is NP-hard in 3D

We prove that a particular pushing-blocks puzzle is intractable in 3D. The puzzle, inspired by the game PushPush, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between giv...

arxiv.org/abs/1010.3362v1

A pointwise ergodic theorem for Fuchsian groups

We use Series' Markovian coding for words in Fuchsian groups and the Bowen-Series coding of limit sets to prove an ergodic theorem for Cesaro averages of spherical averages in a Fuchsian group....

arxiv.org/abs/2506.22857v2

Catching Rats in $H$-minor-free Graphs

We show that every $H$-minor-free graph that also excludes a $(k \times k)$-grid as a minor has treewidth/branchwidth bounded from above by a function $f(t,k)$ that is linear in $k$ and polynomial in $t := |V(H)|$. Such a result was proven originally...

arxiv.org/abs/math/0608419v1

Counting Keith numbers

A Keith number is a positive integer N with the decimal representation a_1a_2...a_n such that n>=2 and N appears in the sequence (K_m) given by the recurrence K_1=a_1,...,K_n=a_n and K_m=K_{m-1}+K_{m-2}+...+K_{m-n} for m>n. We prove that there are...

arxiv.org/abs/1211.1813v3

Pro cdh-descent for cyclic homology and $K$-theory

In this paper we prove that cyclic homology, topological cyclic homology, and algebraic $K$-theory satisfy a pro Mayer--Vietoris property with respect to abstract blow-up squares of varieties, in both zero and finite characteristic. This may be inter...

arxiv.org/abs/1811.08719v1

A Simple Proof for the Cycle Double Cover Conjecture

Given a bridgeless graph G, the well-known cycle double cover conjecture posits that there is a list of cycles of G, such that every edge appears in exactly two cycles. In this paper, we prove the cycle double cover conjecture. More precisely, we pro...

arxiv.org/abs/0912.2514v2

On the Structure of Covers of Sofic Shifts

A canonical cover generalizing the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left Krieger cover and the past set cover of a sofic shift can be divided into natural layers. These results are used to find the...

arxiv.org/abs/1406.5056v2

Maximum walk entropy implies walk regularity

The notion of walk entropy $S^V(G,β)$ for a graph $G$ at the inverse temperature $β$ was put forward recently by Estrada et al. (2014) \cite{6}. It was further proved by Benzi \cite{1} that a graph is walk-regular if and only if its walk entropy is...

arxiv.org/abs/1803.08691v1

Deep learning and its application to medical image segmentation

One of the most common tasks in medical imaging is semantic segmentation. Achieving this segmentation automatically has been an active area of research, but the task has been proven very challenging due to the large variation of anatomy across differ...