Search results for "Combinatorics"

Lower and Upper Probability Bounds for Some Conjunctions of Two Conditional Events

2018

In this paper we consider, in the framework of coherence, four different definitions of conjunction among conditional events. In each of these definitions the conjunction is still a conditional event. We first recall the different definitions of conjunction; then, given a coherent probability assessment (x, y) on a family of two conditional events \(\{A|H,B|K\}\), for each conjunction \((A|H) \wedge (B|K)\) we determine the (best) lower and upper bounds for the extension \(z=P[(A|H) \wedge (B|K)]\). We show that, in general, these lower and upper bounds differ from the classical Frechet-Hoeffding bounds. Moreover, we recall a notion of conjunction studied in recent papers, such that the res…

Automorphisms of simplicial complexes and their Stanley-Reisner rings

1997

Regular subclasses in the Sobolev space

2009

Abstract We study some slight modifications of the class α - A C n ( Ω , R m ) introduced in [D. Bongiorno, Absolutely continuous functions in R n , J. Math. Anal. and Appl. 303 (2005) 119–134]. In particular we prove that the classes α - A C λ n ( Ω , R m ) , 0 λ 1 , introduced in [C. Di Bari, C. Vetro, A remark on absolutely continuous functions in R n , Rend. Circ. Matem. Palermo 55 (2006) 296–304] are independent by λ and contain properly the class α - A C n ( Ω , R m ) . Moreover we prove that α - A C n ( Ω , R m ) = ( α - A C λ n ( Ω , R m ) ) ∩ ( α - A C n , λ ( Ω , R m ) ) , where α - A C n , λ ( Ω , R m ) is the symmetric class of α - A C λ n ( Ω , R m ) , 0 λ 1 .

The best constant for the Sobolev trace embedding from into

2004

Abstract In this paper we study the best constant, λ 1 ( Ω ) for the trace map from W 1 , 1 ( Ω ) into L 1 ( ∂ Ω ) . We show that this constant is attained in BV ( Ω ) when λ 1 ( Ω ) 1 . Moreover, we prove that this constant can be obtained as limit when p ↘ 1 of the best constant of W 1 , p ( Ω ) ↪ L p ( ∂ Ω ) . To perform the proofs we will look at Neumann problems involving the 1-Laplacian, Δ 1 ( u ) = div ( Du / | Du | ) .

${\cal H}^1$ -estimates of Jacobians by subdeterminants

2002

Let $f:\Omega \rightarrow{\Bbb R}^n$ be a mapping in the Sobolev space $W^{1,n-1}_{loc}(\Omega,{\Bbb R}^n), n\geq 2$ . We assume that the cofactors of the differential matrix Df(x) belong to $L^\frac{n}{n-1}(\Omega)$ . Then, among other things, we prove that the Jacobian determinant detDf lies in the Hardy space ${\cal H}^1(\Omega)$ .

Restriction of characters to Sylow normalizers

2001

Suppose that G is a finite p -solvable group and let \chi \in {\rm Irr}(G) be of p^\prime -degree. In this note, we investigate when \chi remains irreducible when restricted to {\bf {N)}_{G}(P) .

Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof

2019

Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences

2014

The degree of predictability of a sequence can be measured by its entropy and it is closely related to its repetitiveness and compressibility. Entropic profiles are useful tools to study the under- and over-representation of subsequences, providing also information about the scale of each conserved DNA region. On the other hand, compact classes of repetitive motifs, such as maximal motifs, have been proved to be useful for the identification of significant repetitions and for the compression of biological sequences. In this paper we show that there is a relationship between entropic profiles and maximal motifs, and in particular we prove that the former are a subset of the latter. As a furt…

Calculation of Splines Values by Subdivision

2014

Assume, the samples of a spline \(S(t)\in {}^{p}\fancyscript{S}\) on the grid \(\mathbf{g} =\{k\}_{k\in \mathbb {Z}}\) are available: \(S(k)=y[k]\). Subdivision schemes are proposed to calculate the spline’s values at dyadic and triadic rational points \(S(k/2^m)\) and \(S(k/3^m)\). The SHA technique provides fast and explicit implementation of the subdivision for one- and two-dimensional periodic splines.

Markov Chains and Electrical Networks

2020

There is a natural connection between electrical networks and so called reversible Markov chains. An example for such a chain is the symmetric graph random walk which, in each step, jumps to a randomly chosen graph neighbor at equal probability. This connection is studied here in some detail. As an application, we prove the statement that if such a graph random walk is recurrent, then it is recurrent also on each subgraph. (Although this statement is rather plausible, it is hard to show by different means.) In particular, the graph random walk on a percolation cluster of the planar integer lattice is recurrent.