-
2981
On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree
Published 2022-12-01Get full text
Article -
2982
The splitting method and Poincare's theorem: (I) - the geometric part
Published 2002-11-01“…At the price of a small extension of the definition of a combinatoric tiling, which we call quasi-combinatoric, we show that all tessellations with the above numbers p, q and r are quasi-combinatoric for all possible values of p, q and r, the case when p=2 and q=3 being included. …”
Get full text
Article -
2983
Robot's hand and expansions in non-integer bases
Published 2014-06-01“…Combinatorics…”
Get full text
Article -
2984
Representation type of Hecke algebras of type A
Published 2002“…In this paper we provide a complete classification of the representation type for the blocks for the Hecke algebra of type A, stated in terms of combinatorical data. The computation of the complexity of Young modules is a key component in the proof of this classification result.…”
Journal article -
2985
Notes on the Hodge conjecture for Fermat varieties
Published 2021-01-01“…We review a combinatoric approach to the Hodge conjecture for Fermat varieties and announce new cases where the conjecture is true. …”
Get full text
Article -
2986
What's your neural function, visual narrative conjunction? Grammar, meaning, and fluency in sequential image processing
Published 2017-05-01“…Greater anterior negativity in frequent manga readers suggests more reliance on combinatoric processing; larger P600 effects in infrequent manga readers suggest more resources devoted to mental updating. …”
Get full text
Article -
2987
Search for charmless hadronic decays of B mesons with the SLAC SLD detector
Published 2000“…The precise tracking capabilities of the SLD detector provided for the efficient reduction of combinatoric backgrounds, yielding the most precise available limits for ten of these modes.…”
Journal article -
2988
Multiword expressions : a pain in the neck for NLP
Published 2011“…The various kinds of multiword expressions should be analyzed in distinct ways, including listing “words with spaces”, hierarchically organized lexicons, restricted combinatoric rules, lexical selection, “idiomatic constructions” and simple statistical affinity. …”
Get full text
Get full text
Conference Paper -
2989
Finite Simple Graphs and Their Associated Graph Lattices
Published 2018-11-01“…In his 2005 dissertation, Antoine Vella explored combinatorical aspects of finite graphs utilizing a topological space whose open sets are intimately tied to the structure of the graph. …”
Get full text
Article -
2990
A note on a one-parameter family of non-symmetric number triangles
Published 2012-01-01“…The recent growing interest in special Clifford algebra valued polynomial solutions of generalized Cauchy-Riemann systems in \((n + 1)\)-dimensional Euclidean spaces suggested a detailed study of the arithmetical properties of their coefficients, due to their combinatoric relevance. This concerns, in particular, a generalized Appell sequence of homogeneous polynomials whose coefficient set can be treated as a one-parameter family of non-symmetric triangles of fractions. …”
Get full text
Article -
2991
Renormalized Schwinger–Dyson functional
Published 2021-02-01“…It is shown that, by means of the renormalized perturbation theory, a canonical renormalization procedure for the Schwinger–Dyson functional is obtained. The combinatoric structure of the Feynman diagrams is illustrated in the case of scalar models. …”
Get full text
Article -
2992
Methods for Parallelizing Search Paths in Phrasing
Published 2004“…Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate and serialize work at considerable computational expense. …”
Get full text
-
2993
Matera in Many Dimensions
Published 2019-01-01“…We reach this objective by using a combinatoric puzzle and suitable story telling.…”
Get full text
Article -
2994
The splitting method and Poincare's theorem: (II) - matrix, polynomial and language
Published 2003-04-01“…This new part is also based on the definition of a combinatoric tiling which was detailed in the previous issue. …”
Get full text
Article -
2995
Conversion in poetic communication of Afanasy Fet’s lyric poetry
Published 2018-04-01“…In conclusion, the poetic discourse combinatorically connects different facets of language realization which forms semantic variety of lyrics and unordinary nature of the reader's reception.…”
Get full text
Article -
2996
Navigability, Walkability, and Perspicacity Associated with Canonical Ensembles of Walks in Finite Connected Undirected Graphs—Toward Information Graph Theory
Published 2023-06-01“…The application of information theory methods to problems about graphs, in contrast to geometric, combinatoric, algorithmic, and algebraic approaches, can be called information graph theory. …”
Get full text
Article -
2997
Combinatorial characterization of a certain class of words and a conjectured connection with general subclasses of phylogenetic tree-child networks
Published 2021-11-01“…We expect that the study of the relationship between the newly defined words and the networks will lead to further combinatoric characterizations of this class of phylogenetic networks.…”
Get full text
Article -
2998
Interaction and Depth against Nondeterminism in Proof Search
Published 2014-05-01“…Deep inference provides more freedom in the design of deductive systems for different logics and a rich combinatoric analysis of proofs. In particular, construction of exponentially shorter analytic proofs becomes possible, however with the cost of a greater nondeterminism than in the sequent calculus. …”
Get full text
Article -
2999
Etnomatematika Dan Pemecahan Masalah Kombinatorik
Published 2017-11-01“…Methods of data collection is done by the test method is a combinatoric problem solving test. Hypothesis test is done by using t-test average test. …”
Get full text
Article -
3000
Relating Vertex and Global Graph Entropy in Randomly Generated Graphs
Published 2018-06-01“…Combinatoric measures of entropy capture the complexity of a graph but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. …”
Get full text
Article