Search results for "Combinatorics"
showing 10 items of 1770 documents
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.
Fast equivariant JADE
2013
Independent component analysis (ICA) is a widely used signal processing tool having applications in various fields of science. In this paper we focus on affine equivariant ICA methods. Two such well-established estimation methods, FOBI and JADE, diagonalize certain fourth order cumulant matrices to extract the independent components. FOBI uses one cumulant matrix only, and is therefore computationally very fast. However, it is not able to separate identically distributed components which is a major drawback. JADE overcomes this restriction. Unfortunately, JADE uses a huge number of cumulant matrices and is computationally very heavy in high-dimensional cases. In this paper, we hybridize the…
Inverted and mirror repeats in model nucleotide sequences.
2007
We analytically and numerically study the probabilistic properties of inverted and mirror repeats in model sequences of nucleic acids. We consider both perfect and non-perfect repeats, i.e. repeats with mismatches and gaps. The considered sequence models are independent identically distributed (i.i.d.) sequences, Markov processes and long range sequences. We show that the number of repeats in correlated sequences is significantly larger than in i.i.d. sequences and that this discrepancy increases exponentially with the repeat length for long range sequences.
A common extension of Arhangel'skii's Theorem and the Hajnal-Juhasz inequality
2019
AbstractWe present a result about $G_{\unicode[STIX]{x1D6FF}}$ covers of a Hausdorff space that implies various known cardinal inequalities, including the following two fundamental results in the theory of cardinal invariants in topology: $|X|\leqslant 2^{L(X)\unicode[STIX]{x1D712}(X)}$ (Arhangel’skiĭ) and $|X|\leqslant 2^{c(X)\unicode[STIX]{x1D712}(X)}$ (Hajnal–Juhász). This solves a question that goes back to Bell, Ginsburg and Woods’s 1978 paper (M. Bell, J.N. Ginsburg and R.G. Woods, Cardinal inequalities for topological spaces involving the weak Lindelöf number, Pacific J. Math. 79(1978), 37–45) and is mentioned in Hodel’s survey on Arhangel’skiĭ’s Theorem (R. Hodel, Arhangel’skii’s so…
A branch and bound algorithm for the matrix bandwidth minimization
2008
In this article, we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is as close as possible to the main diagonal. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the non-zero elements of the corresponding symmetrical matrix. We propose a new branch and bound algorithm and new expressions for known lower bounds for this problem. Empirical results with a collection of previously reported instances indicate that the propose…