Search results for "combinatoric"
showing 10 items of 1776 documents
Regularity and h-polynomials of toric ideals of graphs
2020
For all integers 4 ≤ r ≤ d 4 \leq r \leq d , we show that there exists a finite simple graph G = G r , d G= G_{r,d} with toric ideal I G ⊂ R I_G \subset R such that R / I G R/I_G has (Castelnuovo–Mumford) regularity r r and h h -polynomial of degree d d . To achieve this goal, we identify a family of graphs such that the graded Betti numbers of the associated toric ideal agree with its initial ideal, and, furthermore, that this initial ideal has linear quotients. As a corollary, we can recover a result of Hibi, Higashitani, Kimura, and O’Keefe that compares the depth and dimension of toric ideals of graphs.
Quantum search of spatial regions
2003
Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(sqrt n) for d at least 3, or O((sqrt n)(log n)^(3/2)) for d=2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include a…
The “λ-medial axis”
2005
Medial axis is known to be unstable for nonsmooth objects. For an open set O, we define the weak feature size, wfs, minimum distance between Oc and the critical points of the function distance to Oc. We introduce the "lambda-medial axis" Mλ of O, a subset of the medial axis of O which captures the homotopy type of O when λ < wfs. We show that, at least for some "regular" values of λ, Mλ remains stable under Hausdorff distance perturbations of Oc.
Hopf bifurcation at infinity for planar vector fields
2007
We study, from a new point of view, families of planar vector fields without singularities $ \{ X_{\mu}$  :  $-\varepsilon < \mu < \varepsilon\} $ defined on the complement of an open ball centered at the origin such that, at $\mu=0$, infinity changes from repellor to attractor, or vice versa. We also study a sort of local stability of some $C^1$ planar vector fields around infinity.
Estudio multivariante de la calidad del agua: Aplicación al río Júcar en el período 1990-2013
2014
SUMMARY A study of the Jucar River’s water quality in the period 1990-2013 is performed using multivariate analysis tools. This study is both of longitudinal and transversal nature, ie, water quality is assessed along the river, thus observing the variations in its characteristics
Sobolev homeomorphic extensions
2021
Let $\mathbb X$ and $\mathbb Y$ be $\ell$-connected Jordan domains, $\ell \in \mathbb N$, with rectifiable boundaries in the complex plane. We prove that any boundary homeomorphism $\varphi \colon \partial \mathbb X \to \partial \mathbb Y$ admits a Sobolev homeomorphic extension $h \colon \overline{\mathbb X} \to \overline{\mathbb Y}$ in $W^{1,1} (\mathbb X, \mathbb C)$. If instead $\mathbb X$ has $s$-hyperbolic growth with $s>p-1$, we show the existence of such an extension lies in the Sobolev class $W^{1,p} (\mathbb X, \mathbb C)$ for $p\in (1,2)$. Our examples show that the assumptions of rectifiable boundary and hyperbolic growth cannot be relaxed. We also consider the existence of $W^{…
In the Shadows of a hypergraph: looking for associated primes of powers of squarefree monomial ideals
2018
The aim of this paper is to study the associated primes of powers of square-free monomial ideals. Each square-free monomial ideal corresponds uniquely to a finite simple hypergraph via the cover ideal construction, and vice versa. Let H be a finite simple hypergraph and J(H) the cover ideal of H. We define the shadows of hypergraph, H, described as a collection of smaller hypergraphs related to H under some conditions. We then investigate how the shadows of H preserve information about the associated primes of the powers of J(H). Finally, we apply our findings on shadows to study the persistence property of square-free monomial ideals and construct some examples exhibiting failure of contai…
An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
2001
International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.
Steiner configurations ideals: Containment and colouring
2021
Given a homogeneous ideal I&sube
"Table 4" of "Measurement of the azimuthal anisotropy for charged particle production in sqrt(s_NN) = 2.76 TeV lead-lead collisions with the ATLAS de…
2012
The Fourier coefficient V_n,n vs. |Delta(ETARAP)| for individual n values.