Search results for "Crete"
showing 10 items of 2495 documents
A graph associated with the $\pi$-character degrees of a group
2003
Let G be a group and $\pi$ be a set of primes. We consider the set ${\rm cd}^{\pi}(G)$ of character degrees of G that are divisible only by primes in $\pi$. In particular, we define $\Gamma^{\pi}(G)$ to be the graph whose vertex set is the set of primes dividing degrees in ${\rm cd}^{\pi}(G)$. There is an edge between p and q if pq divides a degree $a \in {\rm cd}^{\pi}(G)$. We show that if G is $\pi$-solvable, then $\Gamma^{\pi}(G)$ has at most two connected components.
Some Hadamard designs with parameters (71,35,17)
2002
Up to isomorphisms there are precisely eight symmetric designs with parameters (71, 35, 17) admitting a faithful action of a Frobenius group of order 21 in such a way that an element of order 3 fixes precisely 11 points. Five of these designs have 84 and three have 420 as the order of the full automorphism group G. If |G| = 420, then the structure of G is unique and we have G = (Frob21 × Z5):Z4. In this case Z(G) = 〈1〉, G′ has order 35, and G induces an automorphism group of order 6 of Z7. If |G| = 84, then Z(G) is of order 2, and in precisely one case a Sylow 2-subgroup is elementary abelian. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 144–149, 2002; DOI 10.1002/jcd.996
The façade-tower of Santa Maria delle Stelle Church in Comiso. Historical events, vulnerability and conservation strategy
2020
Dopo avere richiamato l’estesa vicenda storica della costruzione della chiesa Madre di Santa Maria delle Stelle a Comiso, iniziata nel 1736 e terminata due secoli dopo, il contributo è focalizzato sul tema del completamento della sua facciata con l’uso della struttura intelaia di calcestruzzo di cemento armato, progettata dall’ingegnere Santoro Secolo. In tempi più recenti, alcuni dissesti improvvisi hanno posto in evidenza il tema del rischio e la necessità di interventi per risanare la struttura architettonica. L’importanza del monitoraggio e della manutenzione, intesi come fondamentali strategie di conservazione, concludono l’articolo.
Fixed points in weak non-Archimedean fuzzy metric spaces
2011
Mihet [Fuzzy $\psi$-contractive mappings in non-Archimedean fuzzy metric spaces, Fuzzy Sets and Systems, 159 (2008) 739-744] proved a theorem which assures the existence of a fixed point for fuzzy $\psi$-contractive mappings in the framework of complete non-Archimedean fuzzy metric spaces. Motivated by this, we introduce a notion of weak non-Archimedean fuzzy metric space and prove that the weak non-Archimedean fuzzy metric induces a Hausdorff topology. We utilize this new notion to obtain some common fixed point results for a pair of generalized contractive type mappings.
The importance of the inland leg of containerised maritime shipments: An analysis of modal choice determinants in Spain
2011
Abstract While most of the studies that address competition between road and rail transport focus on national or international non-maritime shipments, there is practically no empirical evidence on the modal choice determinants of the inland leg of maritime shipments. This paper intends to fill that gap by estimating a modal choice model between road and rail transport on the inland leg of Spanish containerised maritime freight shipments, using a mixed logit model and stated preference techniques. The results obtained confirm the vital role that frequency plays in the relative competitiveness of rail transport and also provide subjective values of transport attributes that are deemed essenti…
K4-free Graphs as a Free Algebra
2017
International audience; Graphs of treewidth at most two are the ones excluding the clique with four vertices (K4) as a minor, or equivalently, the graphs whose biconnected components are series-parallel. We turn those graphs into a finitely presented free algebra, answering positively a question by Courcelle and Engelfriet, in the case of treewidth two. First we propose a syntax for denoting these graphs: in addition to parallel composition and series composition, it suffices to consider the neutral elements of those operations and a unary transpose operation. Then we give a finite equational presentation and we prove it complete: two terms from the syntax are congruent if and only if they …
Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms
2005
The complexity of quantum query algorithms computing Boolean functions is strongly related to the degree of the algebraic polynomial representing this Boolean function. There are two related difficult open problems. First, Boolean functions are sought for which the complexity of exact quantum query algorithms is essentially less than the complexity of deterministic query algorithms for the same function. Second, Boolean functions are sought for which the degree of the representing polynomial is essentially less than the complexity of deterministic query algorithms. We present in this paper new techniques to solve the second problem.
Fully Automatic Trunk Packing with Free Placements
2010
We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and from combinatorial optimization. It finds better solutions than previous approaches for small trunks.
Multiple solutions for a discrete boundary value problem involving the p-Laplacian.
2008
Multiple solutions for a discrete boundary value problem involving the p-Laplacian are established. Our approach is based on critical point theory.