Добірка наукової літератури з теми "Additive combinatory"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Additive combinatory".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Additive combinatory"
Bimbó, Katalin. "The Church-Rosser property in dual combinatory logic." Journal of Symbolic Logic 68, no. 1 (March 2003): 132–52. http://dx.doi.org/10.2178/jsl/1045861508.
Повний текст джерелаErdmann, Kati, Jessica Ringel, Silke Hampel, Manfred P. Wirth, and Susanne Fuessel. "Carbon nanomaterials sensitize prostate cancer cells to docetaxel and mitomycin C via induction of apoptosis and inhibition of proliferation." Beilstein Journal of Nanotechnology 8 (June 23, 2017): 1307–17. http://dx.doi.org/10.3762/bjnano.8.132.
Повний текст джерелаNetopilova, Marie, Marketa Houdkova, Klara Urbanova, Johana Rondevaldova, and Ladislav Kokoska. "Validation of Qualitative Broth Volatilization Checkerboard Method for Testing of Essential Oils: Dual-Column GC–FID/MS Analysis and In Vitro Combinatory Antimicrobial Effect of Origanum vulgare and Thymus vulgaris against Staphylococcus aureus in Liquid and Vapor Phases." Plants 10, no. 2 (February 18, 2021): 393. http://dx.doi.org/10.3390/plants10020393.
Повний текст джерелаYang, Shun-Kai, Khatijah Yusoff, Chun-Wai Mai, Wei-Meng Lim, Wai-Sum Yap, Swee-Hua Lim, and Kok-Song Lai. "Additivity vs Synergism: Investigation of the Additive Interaction of Cinnamon Bark Oil and Meropenem in Combinatory Therapy." Molecules 22, no. 11 (November 4, 2017): 1733. http://dx.doi.org/10.3390/molecules22111733.
Повний текст джерелаDotti Sani, Giulia Maria, and Mario Quaranta. "A Mixed Approach to the Work-Motherhood Relation: An Application of Fuzzy Set Qualitative Comparative Analysis and Generalized Linear Models." Comparative Sociology 12, no. 1 (2013): 31–65. http://dx.doi.org/10.1163/15691330-12341251.
Повний текст джерелаBhattamisra, Subrat Kumar, Chew Hui Kuean, Lee Boon Chieh, Vivian Lee Yean Yan, Chin Koh Lee, Lee Peng Hooi, Lai Pei Shyan, Yun Khoon Liew, Mayuren Candasamy, and Priyadarshi Soumyaranjan Sahu. "Antibacterial Activity of Geraniol in Combination with Standard Antibiotics against Staphylococcus aureus, Escherichia coli and Helicobacter pylori." Natural Product Communications 13, no. 7 (July 2018): 1934578X1801300. http://dx.doi.org/10.1177/1934578x1801300701.
Повний текст джерелаSakaue, Saori, Masato Akiyama, Makoto Hirata, Koichi Matsuda, Yoshinori Murakami, Michiaki Kubo, Yoichiro Kamatani, and Yukinori Okada. "Functional variants in ADH1B and ALDH2 are non-additively associated with all-cause mortality in Japanese population." European Journal of Human Genetics 28, no. 3 (September 26, 2019): 378–82. http://dx.doi.org/10.1038/s41431-019-0518-y.
Повний текст джерелаVillalobos-González, Antonio, Ignacio Benítez-Riquelme, Fernando Castillo-González, Ma del Carmen Mendoza-Castillo, and Alejandro Espinosa-Calderón. "Genetic Parameters in Mesocotyl Elongation and Principal Components for Corn in High Valleys, Mexico." Seeds 3, no. 1 (March 13, 2024): 149–68. http://dx.doi.org/10.3390/seeds3010012.
Повний текст джерелаMiklasińska-Majdanik, Maria, Małgorzata Kępa, Tomasz J. Wąsik, Karolina Zapletal-Pudełko, Magdalena Klim, and Robert D. Wojtyczka. "The Direction of the Antibacterial Effect of Rutin Hydrate and Amikacin." Antibiotics 12, no. 9 (September 21, 2023): 1469. http://dx.doi.org/10.3390/antibiotics12091469.
Повний текст джерелаMuñoz Romero, Luis Ángel, Enrique Navarro Guerrero, Manuel De la Rosa Ibarra, Luis Pérez Romero, and Ángel Enrique Caamal Dzul. "Estimación de varianzas genéticas en ocho variedades criollas de maíz para el Bajío mexicano." Agronomía Mesoamericana 28, no. 2 (April 30, 2017): 455. http://dx.doi.org/10.15517/ma.v28i2.21801.
Повний текст джерелаДисертації з теми "Additive combinatory"
Riblet, Robin. "Ensembles de petite somme et ensembles de Sidon, étude de deux extrêmes." Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0127.
Повний текст джерелаOur project lies in the field of additive combinatorics. More precisely, we seek the maximal size of a progression free subset of a finite group G, meaning a subset with no three distinct elements of the form a, a+d, a+2d (called a 3AP for 3 arithmetic progression). A 3AP is a simple and natural pattern that we expect to find in a 'large enough' set and we shall try to precise what 'large enough' means here. Trying to determine the maximal size of a progression free set is now a classical problem in additive combinatorics, on which many of the best experts have worked. There are two different aspects in this problem : to determine a minimal size for A which assures the existence of 3AP in A, this gives an upper bound for the maximal size of a progression free set; to build some large progression free sets, this gives a lower bound for this maximal size. We will insist on the constructive part in the context of groups Z_q^n with small q. We shall also try to adapt a construction by Ruzsa to this context. The progression of this work should be from some combinatorial constructions, allowing numerical approach, to more theoretical concepts
Liétard, Florian. "Évitabilité de puissances additives en combinatoire des mots." Electronic Thesis or Diss., Université de Lorraine, 2020. http://www.theses.fr/2020LORR0259.
Повний текст джерелаThe present thesis is dedicated to the various aspects of the problem of avoiding additive cubes in the fixed points of morphisms. Problems concerning the avoidability of additive powers are closely related to questions in the theory of semigroups. Since the publication of the article of J. Cassaigne, J.D. Currie, L. Schaeffer and J.O. Shallit (2013) we know that it is possible to construct an infinite word over {0, 1 ,3, 4} that avoids additive cubes, i.e., a word that avoids three consecutive blocks of same size and same sum. We first explain the methods used by the authors in their article, and then use it as a starting point for our discussions, with the ultimate aim to clarify the various similarities and connections between the different morphisms that allow to avoid additive cubes on alphabets over 4 letters. We next discuss our implementation in C++ of the investigation of theses morphisms, and then proceed to give an infinite family of morphisms (corresponding to classes of equivalence) that avoid additive cubes. After this investigation, we give a general proof scheme that is based on substitutions between morphisms. The main result of the thesis is that for any alphabet of 4 letters, with the sole exception of the alphabet {0, 1 ,2, 3} and its affine transformations, there is an explicit morphism whose infinite fixed point avoids additive cubes over the given alphabet. This work has been carried out in collaboration with Matthieu Rosenfeld and gave rise to an article in a peer-reviewed journal. In order to show this result, we use arguments from the article of Cassaigne et al., several numerical estimates for the underlying quantities, case disjunction as well as symmetry considerations for the alphabets under consideration. In the final part of the thesis we then study the question of avoiding additive cubes over {0, 1 ,2, 3} with the hope to answer a question posed by M. Rao and M. Rosenfeld in 2018. This alphabet is the only 4-letters alphabet where our result does not apply. We first study by graphical means the words that contain additive powers, and we discuss and implement in a second step two parallelized computer programs. The first program detects in an efficient way the occurrence of additive powers in very long words, whereas the second one allows to create long words over {0, 1 ,2, 3} without introducing any additive cube. With the help of these programs, we obtain a word of over 70 million letters that avoids additive cubes over {0, 1 ,2, 3}. This largely improves on the former known bound (1.4 x 10^5). To obtain our result, as suggested by our graphical considerations, we periodically reverse the order of priority for the choice of the letters in the construction of our word. Our programs use multi-computers and multi-threads settings to gain considerably on efficiency
Lambert, Victor. "Quelques problèmes additifs : bases, pseudo-puissances et ensembles k-libres." Palaiseau, Ecole polytechnique, 2015. https://theses.hal.science/tel-01174654/document.
Повний текст джерелаWidely studied in N or Z, we are interested in additive bases in infinite abelian groups. We get some results about the functions E, X and S, which caracterize the behaviour of a basis when we remove an element. We also study the set A of pseudo s-th powers, which is an additive basis of order s+1. We wonder what is the minimal size of an additive complement of sA, that is a set B such that sA+B contains all large enough integers. With respect to this problem, we prove quite precise theorems which are tantamount to asserting that a threshold phenomenon occurs. Finally, we establish the maximal size of a k-free set in Z/nZ. The study of this quantity strongly depends on the arithmetical relative properties of n and k. That is why we use different methods depending on cases. In particular, we show a result on combinatorial trees for the general case
Monopoli, F. "SUMSETS AND CARRIES IN CYCLIC GROUPS." Doctoral thesis, Università degli Studi di Milano, 2015. http://hdl.handle.net/2434/342841.
Повний текст джерелаTringali, Salvatore. "Some questions in combinatorial and elementary number theory." Phd thesis, Université Jean Monnet - Saint-Etienne, 2013. http://tel.archives-ouvertes.fr/tel-01060871.
Повний текст джерелаOosting, Peter. "Bicyclic Tramadol analogues : towards a structure-activity relationship." Bordeaux 1, 2007. http://www.theses.fr/2007BOR13413.
Повний текст джерелаBiswas, Arindam. "Théorie des groupes approximatifs et ses applications." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS573.
Повний текст джерелаIn the first part of this thesis, we study the structure of approximate subgroups inside metabelian groups (solvable groups of derived length 2) and show that if A is such a K-approximate subgroup, then it is K^(O(r)) controlled (in the sense of Tao) by a nilpotent group where r denotes the rank of G=Fit(G) and Fit(G) is the fitting subgroup of G.The second part is devoted to the study of growth of sets inside GLn(Fq) , where we show a bound on the diameter (with respect to any set of generators) for all finite simple subgroups of this group. What we have is - if G is a finite simple group of Lie type with rank n, and its base field has bounded size, then the diameter of the Cayley graph C(G; S) would be bounded by exp(O(n(logn)^3)). If the size of the base field Fq is not bounded then our method gives a bound of q^(O(n(log nq)3)) for the diameter.In the third part we are interested in the growth of sets inside commutative Moufang loops which are commutative loops respecting the moufang identities but without (necessarily)being associative. For them we show that if the sizes of the associator sets are bounded then the growth of approximate substructures inside these loops is similar to those in ordinary groups. In this way for the subclass of finitely generated commutative moufang loops we have a classification theorem of its approximate subloops
Verselder, Hélène. "Influence d’activations spatiales et motrices de polarités combinées sur le fonctionnement cognitif : effet de la synchronie-asynchronie temporelle et spatiale sur des combinatoires cognitives de nature mathématique." Thesis, Paris 10, 2017. http://www.theses.fr/2017PA100067.
Повний текст джерелаSeveral studies have shown that an activation of motors (approach-avoidance behaviors, Cretenet & Dru 2004) or spatial cues (vertical or horizontal, Casasanto, 2009) is likely to influence the affective judgment or the final responses. In regards of the theories of embodiment, this studies examine the effect of combined (synchronous or asynchronous) motor and spatial cues on mathematical reasoning as revealing cognitive processes. In this perspective, our work, presented in two articles, with the aim to analyze the effect of these activations, involving the theory of polarity correspondence (Proctor & Cho, 2006), on the resolution of arithmetic operations, as the expression of a particular cognitive functioning. Furthermore, this thesis supports the idea that this operation has some analogy with the polarity correspondence effect (PCE). Indeed, our work supports the idea that whatever the activated conceptual cues are (motivational or emotional), the same effects are observed - a similar system is activated, coded as polarities which might be indicative of the PCE. When the activation of polarity indices (motivational or emotional), a phenomenon of compatibility occurs that also influences mathematical reasoning.We investigate the effect of a motor (performed) or spatial (perceived) movement combining two spatial dimensions (laterality and verticality) simultaneously or not on numerical performance. The objective is to investigate the influence of congruence or noncongruence conditions on the resolution of arithmetic operations. When a synchronous activation of peripheral cues (motor or spatial) is activated, we would observed an effect on mathematical reasoning, such as multiplication (Article 1); while when an asynchronous activation, deferred in time and space, of spatial cues would influence a mathematical reasonning, such as addition (Article 2). For the first time, studies demonstrate how a particular combination of perceptual or motor activations reveals some correspondent cognitive mechanism
Henriot, Kevin. "Structures linéaires dans les ensembles à faible densité." Thèse, Paris 7, 2014. http://hdl.handle.net/1866/11116.
Повний текст джерелаNous présentons trois résultats en combinatoire additive, un domaine récent à la croisée de la combinatoire, l'analyse harmonique et la théorie analytique des nombres. Le thème unificateur de notre thèse est la détection de structures additives dans les ensembles arithmétiques à faible densité, avec un intérêt particulier pour les aspects quantitatifs. Notre première contribution est une estimation de densité améliorée pour le problème, initié entre autres par Bourgain, de trouver une longue progression arithmétique dans un ensemble somme triple. Notre deuxième résultat consiste en une généralisation des bornes de Sanders pour le théorème de Roth, du cas d'un ensemble dense dans les entiers à celui d'un ensemble à faible croissance additive dans un groupe abélien arbitraire. Finalement, nous étendons les meilleures bornes quantitatives connues pour le théorème de Roth dans les premiers, à tous les systèmes d'équations linéaires invariants par translation et de complexité un.
We present three results in additive combinatorics, a recent field at the interface of combinatorics, harmonic analysis and analytic number theory. The unifying theme in our thesis is the detection of additive structure in arithmetic sets of low density, with an emphasis on quantitative aspects. Our first contribution is an improved density estimate for the problem, initiated by Bourgain and others, of finding a long arithmetic progression in a triple sumset. Our second result is a generalization of Sanders' bounds for Roth's theorem from the dense setting, to the setting of small doubling in an arbitrary abelian group. Finally, we extend the best known quantitative results for Roth's theorem in the primes, to all translation-invariant systems of equations of complexity one.
He, Weikun. "Sommes, produits et projections des ensembles discrétisés." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS335/document.
Повний текст джерелаIn the discretized setting, the size of a set is measured by its covering number by δ-balls (a.k.a. metric entropy), where δ is the scale. In this document, we investigate combinatorial properties of discretized sets under addition, multiplication and orthogonal projection. There are three parts. First, we prove sum-product estimates in matrix algebras, generalizing Bourgain's sum-product theorem in the ring of real numbers and improving higher dimensional sum-product estimates previously obtained by Bourgain-Gamburd. Then, we study orthogonal projections of subsets in the Euclidean space, generalizing Bourgain's discretized projection theorem to higher rank situations. Finally, in a joint work with Nicolas de Saxcé, we prove a product theorem for perfect Lie groups, generalizing previous results of Bourgain-Gamburd and Saxcé
Частини книг з теми "Additive combinatory"
Eisenbrand, Friedrich, Naonori Kakimura, Thomas Rothvoß, and Laura Sanità. "Set Covering with Ordered Replacement: Additive and Multiplicative Gaps." In Integer Programming and Combinatoral Optimization, 170–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20807-2_14.
Повний текст джерелаТези доповідей конференцій з теми "Additive combinatory"
Eranpurwala, Aliakbar, Seyedeh Elaheh Ghiasian, and Kemper Lewis. "Predicting Build Orientation of Additively Manufactured Parts With Mechanical Machining Features Using Deep Learning." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22043.
Повний текст джерела