Search results for "Combinatorics"
showing 10 items of 1770 documents
Remarks about the Besicovitch Covering Property in Carnot groups of step 3 and higher
2016
International audience
THE STATE OF FRACTIONAL HEREDITARY MATERIALS (FHM)
2014
The widespread interest on the hereditary behavior of biological and bioinspired materials motivates deeper studies on their macroscopic ``minimal" state. The resulting integral equations for the detected relaxation and creep power-laws, of exponent $\beta$, are characterized by fractional operators. Here strains in $SBV_{loc}$ are considered to account for time-like jumps. Consistently, starting from stresses in $L_{loc}^{r}$, $r\in [1,\beta^{-1}], \, \, \beta\in(0,1)$ we reconstruct the corresponding strain by extending a result in [42]. The ``minimal" state is explored by showing that different histories delivering the same response are such that the fractional derivative of their differ…
Multiple solutions for nonlinear nonhomogeneous resonant coercive problems
2018
We consider a nonlinear, nonhomogeneous Dirichlet problem driven by the sum of a \begin{document}$p$\end{document} -Laplacian ( \begin{document}$2 ) and a Laplacian. The reaction term is a Caratheodory function \begin{document}$f(z,x)$\end{document} which is resonant with respect to the principal eigenvalue of ( \begin{document}$-\Delta_p,\, W^{1,p}_0(\Omega)$\end{document} ). Using variational methods combined with truncation and comparison techniques and Morse theory (critical groups) we prove the existence of three nontrivial smooth solutions all with sign information and under three different conditions concerning the behavior of \begin{document}$f(z,\cdot)$\end{document} near zero. By …
Coupled fixed point theorems for multi-valued nonlinear contraction mappings in partially ordered metric spaces
2011
Abstract In this paper, we establish two coupled fixed point theorems for multi-valued nonlinear contraction mappings in partially ordered metric spaces. The theorems presented extend some results due to Ciric (2009) [3] . An example is given to illustrate the usability of our results.
Optimal lower bounds for eigenvalues of linear and nonlinear Neumann problems
2013
In this paper we prove a sharp lower bound for the first non-trivial Neumann eigenvalue μ1(Ω) for the p-Laplace operator (p > 1) in a Lipschitz bounded domain Ω in ℝn. Our estimate does not require any convexity assumption on Ω and it involves the best isoperimetric constant relative to Ω. In a suitable class of convex planar domains, our bound turns out to be better than the one provided by the Payne—Weinberger inequality.
Unicity of biproportion
1994
International audience; The biproportion of S on margins of M is called the intern composition law, K: (S,M) -> X = K(S,M) / X = A S B. A and B are diagonal matrices, algorithmically computed, providing the respect of margins of M. Biproportion is an empirical concept. In this paper, the author shows that any algorithm used to compute a biproportion leads to the me result. Then the concept is unique and no longer empirical. Some special properties are also indicated.
Galois groups and genetic code
2021
This article was inspired by the inverse problem of Galois theory. Galois groups are realized as number theoretic symmetry groups realized physically in TGD a symmetries of space-time surfaces. Galois confinement as an analog of color confinement is proposed in TGD inspired quantum biology . Galois groups, in particular simple Galois groups, play a fundamental role in the TGD view of cognition. The TGD based model of the genetic code involves in an essential manner the groups A5 (icosahedron), which is the smallest non-abelian simple group, and A4 (tetrahedron). The identification of these groups as Galois groups leads to a more precise view about genetic code. The question why the genetic …
On shortening u-cycles and u-words for permutations
2017
Abstract This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature to the recent relevant studies for the de Bruijn sequences. A particular result we obtain in this paper is that u-words for n -permutations exist of lengths n ! + ( 1 − k ) ( n − 1 ) for k = 0 , 1 , … , ( n − 2 ) ! .
Gray coding cubic planar maps
2016
International audience; The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps. (C) 2015 Elsevier B.V. All rights reserved.
Words with the Maximum Number of Abelian Squares
2015
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.