Search results for " Combinatoric"

showing 10 items of 299 documents

A note on k-generalized projections

2007

Abstract In this note, we investigate characterizations for k -generalized projections (i.e., A k  =  A ∗ ) on Hilbert spaces. The obtained results generalize those for generalized projections on Hilbert spaces in [Hong-Ke Du, Yuan Li, The spectral characterization of generalized projections, Linear Algebra Appl. 400 (2005) 313–318] and those for matrices in [J. Benitez, N. Thome, Characterizations and linear combinations of k -generalized projectors, Linear Algebra Appl. 410 (2005) 150–159].

Pure mathematicsNumerical AnalysisAlgebra and Number TheoryNormal matricesHilbert spaceCharacterization (mathematics)Matrius (Matemàtica)Normal matrixAlgebrasymbols.namesakeLinear algebrasymbolsDiscrete Mathematics and CombinatoricsSpectral projectionGeometry and TopologyÀlgebra linealLinear combinationProjectionst-Potent matricesMathematicsLinear Algebra and its Applications
researchProduct

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…

Pure mathematicsState variableApplied MathematicsZero (complex analysis)State (functional analysis)Integral equationAction (physics)Fractional calculusFractional hereditary materials power-law functionally graded microstructureExponentDiscrete Mathematics and CombinatoricsRelaxation (physics)Settore ICAR/08 - Scienza Delle CostruzioniMathematics
researchProduct

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 …

Pure mathematicsTruncation01 natural sciencesResonanceExtremal constant sign solutionConstant sign and nodal solutionDiscrete Mathematics and Combinatorics0101 mathematicsEigenvalues and eigenvectorsCritical groupDiscrete Mathematics and CombinatoricMorse theoryNonlinear regularityPhysicsDirichlet problemMultiple smooth solutionComputer Science::Information RetrievalApplied Mathematics010102 general mathematicsZero (complex analysis)AnalysiFunction (mathematics)010101 applied mathematicsLaplace operatorAnalysisSign (mathematics)
researchProduct

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 …

Q01 Interdisciplinary sciences (General)B Philosophy (General)QA01 Combinatorics
researchProduct

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 ) ! .

QA75De Bruijn sequenceApplied Mathematics0211 other engineering and technologies021107 urban & regional planning0102 computer and information sciences02 engineering and technology01 natural sciencesCombinatorics010201 computation theory & mathematicsFOS: MathematicsDiscrete Mathematics and CombinatoricsMathematics - CombinatoricsCombinatorics (math.CO)Mathematics
researchProduct

Random tensor theory: extending random matrix theory to random product states

2009

We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in (C^d)^{otimes k}, where k and p/d^k are fixed while d grows. When k=1, the Marcenko-Pastur law determines (up to small corrections) not only the largest eigenvalue ((1+sqrt{p/d^k})^2) but the smallest eigenvalue (min(0,1-sqrt{p/d^k})^2) and the spectral density in between. We use the method of moments to show that for k>1 the largest eigenvalue is still approximately (1+sqrt{p/d^k})^2 and the spectral density approaches that of the Marcenko-Pastur law, generalizing the random matrix theory result to the random tensor case.…

Quantum PhysicsFOS: MathematicsMathematics - CombinatoricsFOS: Physical sciencesCombinatorics (math.CO)Quantum Physics (quant-ph)
researchProduct

Homogeneous actions on the random graph

2018

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite group, admit such an action and we extend our results to groups acting on trees. Finally, we show the ubiquity of finitely generated free dense subgroups of the automorphism group of the Random Graph whose action on it have all orbits infinite.

Random graphFinite group20B22 (primary) 20E06 20E05 05C63 54E52 (secondary)Group Theory (math.GR)Homogeneous actions16. Peace & justicegroups acting on trees[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]Action (physics)CombinatoricsMathematics::Group TheoryFree productHomogeneousBaire category theoremFOS: MathematicsDiscrete Mathematics and CombinatoricsCountable setBaire category theoremfree groupsGeometry and TopologyFinitely-generated abelian groupMathematics - Group TheoryMSC: 20B22 (primary); 20E06 20E05 05C63 54E52 (secondary)random graphMathematicsGroups, Geometry, and Dynamics
researchProduct

Maintaining Dynamic Minimum Spanning Trees: An Experimental Study

2010

AbstractWe report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson’s algorithm, and other (less sophisticated) dynamic algorithms. In our experiments, we considered as test sets several random, semi-random and worst-case inputs previously considered in the literature together with inputs arising from real-world applications (e.g., a graph of the Internet Autonomous Systems).

Random graphSpanning treeExperimental analysisMinimum spanning tree algorithmsbusiness.industryApplied MathematicsExperimental analysis; Minimum spanning tree algorithms; Dynamic graphsMinimum spanning treeGraphDistributed minimum spanning treedynamic graphs; experimental analysis; minimum spanning tree algorithmsEmpirical researchDynamic problemDiscrete Mathematics and CombinatoricsThe InternetbusinessSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniAlgorithmMathematicsDynamic graphs
researchProduct

A New Class of Searchable and Provably Highly Compressible String Transformations

2019

The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the domains of strings. However, efforts to find non-trivial alternatives of the original, now 25 years old, Burrows-Wheeler string transformation have met limited success. In this paper we bring new lymph to this area by introducing a whole new family of transformations that have all the "myriad virtues" of the BWT: they can be computed and inverted in linear time, they produce provably highly compressible strings, and they support linear time pattern search direc…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniFOS: Computer and information sciences050101 languages & linguisticsBurrows-wheeler transformation; Combinatorics on words; Data indexing and compression000 Computer science knowledge general worksSettore INF/01 - InformaticaCombinatorics on words05 social sciences02 engineering and technologyData_CODINGANDINFORMATIONTHEORYComputer ScienceBurrows-wheeler transformationComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0501 psychology and cognitive sciencesData Structures and Algorithms (cs.DS)Data indexing and compressionCombinatorics on word
researchProduct

Random Stability of an Additive-Quadratic-Quartic Functional Equation

2010

Using the fixed point method, we prove the generalized Hyers-Ulam stability of the following additive-quadratic-quartic functional equation f(x+2y)+f(x−2y)=2f(x+y)+2f(−x−y)+2f(x−y)+2f(y−x)−4f(−x)−2f(x)+f(2y)+f(−2y)−4f(y)−4f(−y) in complete random normed spaces.

Settore MAT/05 - Analisi MatematicaApplied Mathematicslcsh:MathematicsDiscrete Mathematics and Combinatoricslcsh:QA1-939AnalysisRandom normed space fixed point generalized Hyers-Ulam stability additive-quadratic-quartic functional equationJournal of Inequalities and Applications
researchProduct