Log in

Relevant bibliographies by topics / The berge problem / Journal articles

To see the other types of publications on this topic, follow the link: The berge problem.

Journal articles on the topic 'The berge problem'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'The berge problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ikorong, Annouk. "Regarding the Berge Problem." European Journal of Theoretical and Applied Sciences 1, no. 5 (2023): 1517–26. https://doi.org/10.59324/ejtas.2023.1(5).130.

Full text

Abstract:

We say that a graph <i>B </i>is <i>berge </i>(see Berge, C. (1989) or Annouk, I. (2012)) if every graph 𝐵𝐵′∈{𝐵𝐵,𝐵𝐵􀴤} does not contain an induced cycle of odd length ≥5 [𝐵𝐵􀴤 is the complementary graph of <i>B</i>]. A graph <i>G </i>is <i>perfect </i>if every induced subgraph <i>G' </i>of <i>G </i>satisfies 𝑥𝑥(𝐺𝐺′)=𝜔𝜔(𝐺𝐺′), where 𝑥𝑥(𝐺𝐺′)is thr <i>chromatic number </i>of 𝐺𝐺′ and 𝜔𝜔(𝐺𝐺′) is the Clinique number of 𝐺𝐺′. The Berge conjecture states that a graph 𝐻𝐻 is <i>perfect </i>if and only if 𝐻𝐻 is <i>berge. </i>Indeed, the <i>Berge problem </i>(or the difficult part of the Berge conjecture) cons

APA, Harvard, Vancouver, ISO, and other styles

2

Annouk, Ikorong. "Regarding the Berge Problem." European Journal of Theoretical and Applied Sciences 1, no. 5 (2023): 1517–26. http://dx.doi.org/10.59324/ejtas.2023.1(5).130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhu, Zhongxun, Liyi Zheng, Yuan Wang, and Yaping Zhao. "Spectral Turán problem on Berge-K2,t hypergraphs." Filomat 38, no. 9 (2024): 3207–13. https://doi.org/10.2298/fil2409207z.

Full text

Abstract:

It is well-known that Tur?n problem is a classical problem in combinatorics, and the spectral Tur?n-type problem is the special form of Tur?n problem. Given a graph F, a hypergraph is called Ber1e-F if it can be obtained by replacing each edge in F by a hyperedge containing it. In this paper, we investigate the spectral Tur?n-type problem on linear r-uniform hypergraphs without Berge-K,2,t and attain an upper bound of its spectral radius.

APA, Harvard, Vancouver, ISO, and other styles

4

Pykacz, Jarosław, Paweł Bytner, and Piotr Frąckiewicz. "Example of a Finite Game with No Berge Equilibria at All." Games 10, no. 1 (2019): 7. http://dx.doi.org/10.3390/g10010007.

Full text

Abstract:

The problem of the existence of Berge equilibria in the sense of Zhukovskii in normal-form finite games in pure and in mixed strategies is studied. The example of a three-player game that has Berge equilibrium neither in pure, nor in mixed strategies is given.

APA, Harvard, Vancouver, ISO, and other styles

5

BAHMANIAN, M. A. "Detachments of Hypergraphs I: The Berge–Johnson Problem." Combinatorics, Probability and Computing 21, no. 4 (2012): 483–95. http://dx.doi.org/10.1017/s0963548312000041.

Full text

Abstract:

A detachment of a hypergraph is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. For a given edge-coloured hypergraph , we prove that there exists a detachment such that the degree of each vertex and the multiplicity of each edge in (and each colour class of ) are shared fairly among the subvertices in (and each colour class of , respectively).Let $(\lambda_1,\ldots,\lambda_m) K^{h_1,\ldots,\, h_m}_{p_1,\ldots,\, p_n}$ be a hypergraph with vertex partition {V1,. . .,Vn}, |Vi| = pi for 1 ≤ i ≤ n such that there are λ

APA, Harvard, Vancouver, ISO, and other styles

6

Anouk, Ikorong. "The complete short proof of the Berge conjecture." Indonesian Journal of Combinatorics 6, no. 1 (2022): 1. http://dx.doi.org/10.19184/ijc.2022.6.1.1.

Full text

Abstract:

<p>We say that a graph <em>B</em> is berge if every graph <em>B'</em> ∈ {<em>B</em>,<em>B̄</em><em></em>} does not contain an induced cycle of odd length ≥ 5 [<span><em>B̄</em></span> is the complementary graph of <em>B</em>}.</p><p>A graph G is perfect if every induced subgraph <em>G'</em> of <em>G</em> satisfies <em>χ</em>(<em>G'</em>)=<em>ω</em>(<em>G'</em>), where <em>χ</em>(<em>G'</em&

APA, Harvard, Vancouver, ISO, and other styles

7

Esmailpour, Aryan, Boris Glavic, Xiao Hu, and Stavros Sintos. "Smallest Synthetic Witnesses for Conjunctive Queries." Proceedings of the ACM on Management of Data 3, no. 2 (2025): 1–25. https://doi.org/10.1145/3725250.

Full text

Abstract:

Given a self-join-free conjunctive query Q and a set of tuples S , a synthetic witness D is a database instance such that the result of Q on D is S . In this work, we are interested in two problems. First, the existence problem ESW decides whether any synthetic witness D exists. Second, given that a synthetic witness exists, the minimization problem SSW computes a synthetic witness of minimal size. The SSW problem is related to the smallest witness problem recently studied by Hu and Sintos [22]; however, the objective and the results are inherently different. More specifically, we show that SS

APA, Harvard, Vancouver, ISO, and other styles

8

GYÁRFÁS, ANDRÁS, and GÁBOR N. SÁRKÖZY. "The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle." Combinatorics, Probability and Computing 20, no. 1 (2010): 53–71. http://dx.doi.org/10.1017/s0963548310000209.

Full text

Abstract:

The asymptotics of 2-colour Ramsey numbers of loose and tight cycles in 3-uniform hypergraphs were recently determined [16, 17]. We address the same problem for Berge cycles and for 3 colours. Our main result is that the 3-colour Ramsey number of a 3-uniform Berge cycle of length n is asymptotic to $\frac{5n}{4}$. The result is proved with the Regularity Lemma via the existence of a monochromatic connected matching covering asymptotically 4n/5 vertices in the multicoloured 2-shadow graph induced by the colouring of Kn(3).

APA, Harvard, Vancouver, ISO, and other styles

9

Nemron, Ikorong Anouk Gilbert. "A simple dissertation around the Berge problem and the Hadwiger conjecture." Journal of Discrete Mathematical Sciences and Cryptography 12, no. 5 (2009): 571–93. http://dx.doi.org/10.1080/09720529.2009.10698257.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Nahhas, Ahmad, and H. W. Corley. "The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form." International Game Theory Review 20, no. 04 (2018): 1850010. http://dx.doi.org/10.1142/s021919891850010x.

Full text

Abstract:

The mixed Berge equilibrium (MBE) is an extension of the Berge equilibrium (BE) to mixed strategies. The MBE models mutually support in a [Formula: see text]-person noncooperative game in normal form. An MBE is a mixed-strategy profile for the [Formula: see text] players in which every [Formula: see text] players have mixed strategies that maximize the expected payoff for the remaining player’s equilibrium strategy. In this paper, we study the computational complexity of determining whether an MBE exists in a [Formula: see text]-person normal-form game. For a two-person game, an MBE always exi

APA, Harvard, Vancouver, ISO, and other styles

11

Zhukovskiy, V. I., L. V. Zhukovskaya, and Y. S. Mukhina. "A new approach to guaranteed solutions of multicriteria choice problems: Pareto consideration of Savage–Niehans risk and outcomes." Таврический вестник информатики и математики, no. 1 (56), 2023 (June 26, 2023): 42–61. https://doi.org/10.5281/zenodo.8102397.

Full text

Abstract:

This article considers three new approaches to important problems of mathematical game theory and multicriteria choice.The first approach ensures payoff increase with simultaneous risk reduction in the Savage–Niehans sense in multicriteria choice problem and noncooperative games. The second approach allow us to stabilize coalitional structures in cooperative games without side payments under uncertainty. The third approach serves to integrate the selfish Nash equilibrium with the altruistic Berge equilibrium. Note that the investigations involve a special Germeier convolution of criteria

APA, Harvard, Vancouver, ISO, and other styles

12

Manimuthu, Yamuna, and Karthika Kumarasamy. "A Survey on Characterizing Trees Using Domination Number." Mathematics 10, no. 13 (2022): 2173. http://dx.doi.org/10.3390/math10132173.

Full text

Abstract:

Ever since the discovery of domination numbers by Claude Berge in the year 1958, graph domination has become an important domain in graph theory that has strengthened itself as a theory and has extended its contributions to various applications. Tree characterization is an important problem in graph domination. This survey focuses on presenting a collection of results on characterizing trees using domination number.

APA, Harvard, Vancouver, ISO, and other styles

13

Zhukovskiy, Vladislav, Alexander Topchishvili, and Sergey Sachkov. "Application of probability measures to the existence problem of Berge-Vaisman guaranteed equilibrium1." Model Assisted Statistics and Applications 9, no. 3 (2014): 223–39. http://dx.doi.org/10.3233/mas-140295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Ailian, and Liping Zhang. "Minimum degree condition of Berge Hamiltonicity in random 3-uniform hypergraphs." Filomat 37, no. 26 (2023): 9039–50. http://dx.doi.org/10.2298/fil2326039c.

Full text

Abstract:

A graph H has Hamiltonicity if it contains a cycle which covers each vertex of H. In graph theory, Hamiltonicity is a classical and worth studying problem. In 1952, Dirac proved that any n-vertex graph H with minimum degree at least ?n/2? has Hamiltonicity. In 2012, Lee and Sudakov proved that if p ? logn/n , then asympotically almost surely each n-vertex subgraph of random graph G(n,p) with minimum degree at least (1/2 + o(1))np has Hamiltonicity. In this paper, we exend Dirac?s theorem to random 3-uniform hypergraphs. The random 3-uniform hypergraph model H3(n, p) consists of all 3-uniform h

APA, Harvard, Vancouver, ISO, and other styles

15

Hayat, Sakander, Raman Sundareswaran, Marayanagaraj Shanmugapriya та ін. "Characterizations of Minimal Dominating Sets in γ-Endowed and Symmetric γ-Endowed Graphs with Applications to Structure-Property Modeling". Symmetry 16, № 6 (2024): 663. http://dx.doi.org/10.3390/sym16060663.

Full text

Abstract:

Claude Berge (1987) introduced the concept of k-extendable graphs, wherein any independent set of size k is inherently a constituent of a maximum independent set within a graph H=(V,E). Graphs possessing the property of being 1-extendable are termedas Berge graphs. This introduction gave rise to the notion of well-covered graphs and well-dominated graphs. A graph is categorized as well-covered if each of its maximal independent sets is, in fact, a maximum independent set. Similarly, a graph attains the classification of well-dominated if every minimal dominating set (DS) within it is a minimum

APA, Harvard, Vancouver, ISO, and other styles

16

ARAUJO, JULIO, JEAN-CLAUDE BERMOND, and GUILLAUME DUCOFFE. "EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS." Discrete Mathematics, Algorithms and Applications 06, no. 01 (2014): 1450012. http://dx.doi.org/10.1142/s1793830914500128.

Full text

Abstract:

In this paper, we generalize the concepts of Eulerian and Hamiltonian digraphs to directed hypergraphs. A dihypergraphH is a pair (𝒱(H), ℰ(H)), where 𝒱(H) is a non-empty set of elements, called vertices, and ℰ(H) is a collection of ordered pairs of subsets of 𝒱(H), called hyperarcs. It is Eulerian (resp. Hamiltonian) if there is a dicycle containing each hyperarc (resp. each vertex) exactly once. We first present some properties of Eulerian and Hamiltonian dihypergraphs. For example, we show that deciding whether a dihypergraph is Eulerian is an NP-complete problem. We also study when iterated

APA, Harvard, Vancouver, ISO, and other styles

17

Kaczorowska, Małgorzata. "Impact of the intra-party democracy on political parties' reactions to the electoral defeats - a case study of the selected political groupings in Poland." Przegląd Europejski, no. 4-2021 (December 9, 2021): 191–207. http://dx.doi.org/10.31338/1641-2478pe.4.21.12.

Full text

Abstract:

An electoral defeat usually marks a significant turning point in the life of political parties. It is often the beginning of the changes taking place within them (Harmel, Janda 1994; Gauja 2016: p. 50–51). Existing research suggest that the desire to improve the electoral outcome is the main argument for reform within political parties (Janda 1990; Harmel et al. 1995). This article looks at a relationship between the reactions of political parties to electoral defeat and one factor found to be important in this respect – i.e. the level of intra-party democracy (IPD) analysed at the organisatio

APA, Harvard, Vancouver, ISO, and other styles

18

Жуковский, В. И., Л. В. Жуковская, Ю. А. Бельских та М. И. Высокос. "Равновесие по Бержу и по Нэшу в дуополии Бертрана". Таврический вестник информатики и математики, № 2 (63) (14 грудня 2024): 14–25. https://doi.org/10.5281/zenodo.14509262.

Full text

Abstract:

One specialist in the field of operations research decided to use optimization methods to solve a very important problem for him - getting rid of extra fullness. He formalized this problem according to established rules just chosen the target function - weight, restrictions - the minimum of proteins, carbohydrates, fats, etc., then he solved the mathematical problem of minimization under restrictions. The optimal solution was to restrict the ration of food by using vinegar more than three hundred liters per day (the American philosopher Ch. Hitch). In present paper for excepting such "vinegar"

APA, Harvard, Vancouver, ISO, and other styles

19

Капитонова, Т. А., Г. П. Стручкова, and О. И. Слепцов. "Using Bayesian networks to establish recommendations for the case of failure of the northern main gas pipeline." Вычислительные технологии 28, no. 4 (2023): 35–44. http://dx.doi.org/10.25743/ict.2023.28.4.004.

Full text

Abstract:

Предложена модель вероятностного анализа аварий и выработки рекомендаций при отказах магистрального газопровода Мастах–Берге–Якутск с использованием сети Байеса и базы данных, полученной на основе многолетних наблюдений. Выбор байесовских сетей доверия (БСД) связан с тем, что входные факторы задачи, механизм взаимодействия которых носит случайный характер, представляют собой разнородные и неполные данные. Кроме того, модели на основе БСД могут самосовершенствоваться по мере накопления информации. Предложенная БСД позволяет определить основные факторы, приводящие к отказам и авариям, а также ра

APA, Harvard, Vancouver, ISO, and other styles

20

Žukauskienė, Lilia, Vaidas Viršilas, and Carl Åke Farbring. "OPPORTUNITIES OF SOCIO-EDUCATIONAL ASSISTANCE TO INDIVIDUALS SERVING ALTERNATIVE TO IMPRISONMENT SENTENCES: THE PROGRAMME BEHAVIOUR-CONVERSATIONCHANGE APPLICATION ANALYSIS." SOCIETY. INTEGRATION. EDUCATION. Proceedings of the International Scientific Conference 3 (May 26, 2017): 307. http://dx.doi.org/10.17770/sie2017vol3.2263.

Full text

Abstract:

The paper focuses on the issue of socio-educational assistance to alcohol addicts serving non-custodial sentences in the Probation Department of Klaipėda Regional Probation Service. It comments on the results of the behavioural correction programme Behaviour-Conversation-Change (BCC), applied to the individuals serving non-custodial sentences. The research was based on the qualitative research strategy. The conducting of the research was underpinned by the works of W.R. Miller, S.Rollnick (1991, 2002) and numerous other authors on a motivational interview, as well as on a motivational intervie

APA, Harvard, Vancouver, ISO, and other styles

21

Gerbner, Dániel, Abhishek Methuku, Gholamreza Omidi, and Máté Vizer. "Ramsey Problems for Berge Hypergraphs." SIAM Journal on Discrete Mathematics 34, no. 1 (2020): 351–69. http://dx.doi.org/10.1137/18m1225227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Sabitov, I. Kh. "On a Berger Problem." Mathematical Notes 116, no. 3-4 (2024): 745–49. https://doi.org/10.1134/s0001434624090311.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bednarczuk, Ewa M. "Berge-type theorems for vector optimization problems." Optimization 32, no. 4 (1995): 373–84. http://dx.doi.org/10.1080/02331939508844057.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Buchheim, Christoph, Yves Crama, and Elisabeth Rodríguez-Heck. "Berge-acyclic multilinear 0–1 optimization problems." European Journal of Operational Research 273, no. 1 (2019): 102–7. http://dx.doi.org/10.1016/j.ejor.2018.07.045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Gerbner, Dániel, Abhishek Methuku, and Cory Palmer. "General lemmas for Berge–Turán hypergraph problems." European Journal of Combinatorics 86 (May 2020): 103082. http://dx.doi.org/10.1016/j.ejc.2020.103082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ni, Zhenyu, Liying Kang, and Erfang Shan. "Turán Problems for Berge-(k, p)-Fan Hypergraph." Chinese Annals of Mathematics, Series B 42, no. 4 (2021): 487–94. http://dx.doi.org/10.1007/s11401-021-0272-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Crettez, Bertrand. "Unilateral Support Equilibrium, Berge Equilibrium, and Team Problems Solutions." Journal of Quantitative Economics 17, no. 4 (2019): 727–39. http://dx.doi.org/10.1007/s40953-019-00168-w.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Palmer, Cory, Michael Tait, Craig Timmons, and Adam Zsolt Wagner. "Turán numbers for Berge-hypergraphs and related extremal problems." Discrete Mathematics 342, no. 6 (2019): 1553–63. http://dx.doi.org/10.1016/j.disc.2019.02.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Izumi, Hiroki, Sennosuke Watanabe, and Yoshihide Watanabe. "Augmenting trail theorem for the maximum 1-2 matching problem." Discrete Mathematics, Algorithms and Applications 09, no. 04 (2017): 1750056. http://dx.doi.org/10.1142/s1793830917500562.

Full text

Abstract:

We consider the maximum 1-2 matching problem in bipartite graphs. The notion of the augmenting trail for the 1-2 matching problem, which is the extension of the notion of the augmenting path for the 1-1 matching problem is introduced. The main purpose of the present paper is to prove “the augmenting trail theorem” for the 1-2 matching problem in the bipartite graph, which is an analogue of the augmenting path theorem by Bergé for the usual 1-1 matching problems.

APA, Harvard, Vancouver, ISO, and other styles

30

Warner, Amy, and Jens Mittag. "Breaking BAT: can browning create a better white?" Journal of Endocrinology 228, no. 1 (2015): R19—R29. http://dx.doi.org/10.1530/joe-15-0408.

Full text

Abstract:

Obesity and its comorbidities are a growing problem worldwide. In consequence, several new strategies have been proposed to promote weight loss and improve insulin sensitivity. Recently, it has been demonstrated that certain populations of white adipocytes can be ‘browned’, i.e., recruited to a more brown-like adipocyte, capable of thermogenesis through increased expression of uncoupling protein 1. The list of browning agents that induce these so-called beige adipocytes is growing constantly. However, the underlying mechanisms are often poorly understood, with the possibility that some of thes

APA, Harvard, Vancouver, ISO, and other styles

31

Zhou, Yacong, Liying Kang, Lele Liu, and Erfang Shan. "Extremal problems for the p-spectral radius of Berge hypergraphs." Linear Algebra and its Applications 600 (September 2020): 22–39. http://dx.doi.org/10.1016/j.laa.2020.04.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Seto, Michio. "On the Berger-Coburn-Lebow Problem for Hardy Submodules." Canadian Mathematical Bulletin 47, no. 3 (2004): 456–67. http://dx.doi.org/10.4153/cmb-2004-045-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Sterna-Karwat, Alicja. "Semicontinuity of multifunctions connected with optimization with respect to cones." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 40, no. 2 (1986): 183–93. http://dx.doi.org/10.1017/s1446788700027166.

Full text

Abstract:

AbstractThis paper studies topological upper and lower semicontinuity of the minimal value multifunction and the solution multifunction for optimization problems, which are defined in terms of cones, subject to perturbations in constraints. It extends the results of Tanino and Sawaragi to finite dimensions and one of Berge to multiple objective optimization problems.

APA, Harvard, Vancouver, ISO, and other styles

34

Mu'awwanah, Nafisatul. "Konstruksi Pemahaman Masyarakat Terhadap Hadis "Kullu Bid'atin Dlalalah"." Jurnal Studi Ilmu-ilmu Al-Qur'an dan Hadis 17, no. 2 (2018): 159. http://dx.doi.org/10.14421/qh.2016.1702-01.

Full text

Abstract:

This article discusses the problems of bid’ah in society. The problems originated from differences in the public’s understanding of the hadis kullu bid’atin dlalalah. Such defferences include the definition of bid’ah, bid’ah classification, and the methods used to judge the practices that are not practiced by Rasulullah, companions, and scholars of the Salaf. The situation often cause conflicts in society. To solve this problem, Peter L. Berger gave some solution by theory of social contruction. This theory told us that the problems of bid’ah are caused by three processes, there are eksternali

APA, Harvard, Vancouver, ISO, and other styles

35

Berger, T., and R. Zamir. "A semi-continuous version of the Berger-Yeung problem." IEEE Transactions on Information Theory 45, no. 5 (1999): 1520–26. http://dx.doi.org/10.1109/18.771151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Maor, Alina, and Neri Merhav. "On Successive Refinement for the Kaspi/Heegard–Berger Problem." IEEE Transactions on Information Theory 56, no. 8 (2010): 3930–45. http://dx.doi.org/10.1109/tit.2010.2050951.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

NORMANN, D. "The Cook-Berger problem -A guide to the solution." Electronic Notes in Theoretical Computer Science 35 (September 2000): 1–9. http://dx.doi.org/10.1016/s1571-0661(05)01208-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Normann, Dag. "The Cook-Berger problem -A guide to the solution." Electronic Notes in Theoretical Computer Science 35 (2000): 154–62. http://dx.doi.org/10.1016/s1571-0661(05)80737-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Mizser, Lajos. "Bereg megyei családnévvizsgálatok." Névtani Értesítő 27 (2005): 39–43. https://doi.org/10.29178/nevtert.2005.6.

Full text

Abstract:

Researches of family names from Bereg county The present paper is a chapter of a longer study. The author presents here some results of his longer researches and raises some problems he faced in his work. He describes the most important characteristics of family names from the former Bereg county. In this paper he gives examples from 20 settlements (13 in the Ukraine and 7 in Hungary).

APA, Harvard, Vancouver, ISO, and other styles

40

CURTO, RAÚL E., and JASANG YOON. "DISINTEGRATION-OF-MEASURE TECHNIQUES FOR COMMUTING MULTIVARIABLE WEIGHTED SHIFTS." Proceedings of the London Mathematical Society 92, no. 2 (2006): 381–402. http://dx.doi.org/10.1112/s0024611505015601.

Full text

Abstract:

We employ techniques from the theory of disintegration of measures to study the Lifting Problem for commuting $n$-tuples of subnormal weighted shifts. We obtain a new necessary condition for the existence of a lifting, and generate new pathology associated with bringing together the Berger measures associated to each individual weighted shift. For subnormal $2$-variable weighted shifts, we then find the precise relation between the Berger measure of the pair and the Berger measures of the shifts associated to horizontal rows and vertical columns of weights.

APA, Harvard, Vancouver, ISO, and other styles

41

Shi, Jinwen, Ling Liu, Deniz Gunduz, and Cong Ling. "Polar Codes and Polar Lattices for the Heegard–Berger Problem." IEEE Transactions on Communications 66, no. 9 (2018): 3760–71. http://dx.doi.org/10.1109/tcomm.2018.2832618.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Prochnik, George. "Escaping the Magic Kingdom: Berger, Bacon, and the Pinocchio Problem." Critical Quarterly 65, no. 1 (2023): 105–21. http://dx.doi.org/10.1111/criq.12710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Blaise, Pierre, and Vincent De Coorebyter. "L'Islam et l'Etat belge." Res Publica 35, no. 1 (1993): 23–38. http://dx.doi.org/10.21825/rp.v35i1.18822.

Full text

Abstract:

In the countries with a strong muslim immigration, the practice and the organization of Islam represent a national and international politica! stake. The Belgian state, which recognizes and supports the most important cults financially, recognized Islam in 1974. But this cult doesn't still obtain this state support and the questions concerning its organization are more complex than ever. Thelegislation is insufficient and its application almost non-existent. The debates on 'integrism' and hijab have confronted us with the problem of the integrating role of Islam. The Belgian political world se

APA, Harvard, Vancouver, ISO, and other styles

44

Banach, Wiesław. "Kultura a problem zacofania." Człowiek i Społeczeństwo 38 (June 15, 2014): 121–32. http://dx.doi.org/10.14746/cis.2014.38.9.

Full text

Abstract:

The aim of this paper is to present and examine the link between culture and economic backwardness. One of the main questions of economic thought is: why some are so rich and some so poor? Traditionalexplanations like imperialism, dependency and racism are no longer adequate, and increasingly observers are concluding that the principal reason why some countries and ethnic groups are better off than others lies in cultural values, which powerfully shape political, economic and social performance. According to many authors (Lawrence E. Harrison, Samuel P. Huntington, Peter Berger, David Landes,

APA, Harvard, Vancouver, ISO, and other styles

45

Yang, Bin, and Qi Lin Zhang. "Applying a Modified Particle Swarm Optimizer to Section Optimization of Steel Framed Structures." Advanced Materials Research 383-390 (November 2011): 1071–76. http://dx.doi.org/10.4028/www.scientific.net/amr.383-390.1071.

Full text

Abstract:

As a new paradigm of Swarm Intelligence which is inspired by concepts from ’Social Psychology’ and ’Artificial Life’, the Particle Swarm Optimization (PSO), it is widely applied to various kinds of optimization problems especially of nonlinear, non-differentiable or non-convex types. In this paper, a modified guaranteed converged particle swarm algorithm (MGCPSO) is proposed in this paper, which is inspired by guaranteed converged particle swarm algorithm (GCPSO) proposed by von den Bergh. The section sizing optimization problem of steel framed structure subjected to various constraints based

APA, Harvard, Vancouver, ISO, and other styles

46

Haryati, Tatat. "KONSTRUKSI SOSIAL KELUARGA JEPANG KONTEMPORER PADA DRAMA TONARI NO KAZOKU WA AOKU MIERU." LINGUA : JURNAL ILMIAH 17, no. 1 (2021): 1–32. http://dx.doi.org/10.35962/lingua.v17i1.68.

Full text

Abstract:

ABSTRACT This paper contains the social construction to objective reality in the family model that is featured in the TV series Tonari no Kazoku wa Aoku Mieru. The research problem focused on how is the form of social construction to the objective reality of each contemporary family model. The social construction is obtained through externalization, objectivation, and internalization is used to describe the problem patterns of each model of the Contemporary Japanese family in storytelling. The data was collected by observing, taking notes, interpreting, analyzing, and describing the resu

APA, Harvard, Vancouver, ISO, and other styles

47

Martynov, Alexander, Rahul Mehrotra, Suchana Chavanich, et al. "The extraordinary genus Myja is not a tergipedid, but related to the Facelinidae s. str. with the addition of two new species from Japan (Mollusca, Nudibranchia)." ZooKeys 818 (January 23, 2019): 89–116. http://dx.doi.org/10.3897/zookeys.818.30477.

Full text

Abstract:

Morphological and molecular data are presented for the first time in an integrative way for the genus Myja Bergh, 1896. In accordance with the new molecular phylogenies, the traditional Facelinidae is paraphyletic. Herein is presented the phylogenetic placement of true Facelinidae s. str., including the first molecular data for F.auriculata (Müller, 1776), type species of the genus Facelina Alder &amp; Hancock, 1855. The taxonomic history of F.auriculata is reviewed. The genus Myja is related to the clade Facelinidae s. str., but shows disparate morphological traits. Two new species of the

APA, Harvard, Vancouver, ISO, and other styles

48

Martynov, Alexander, Rahul Mehrotra, Suchana Chavanich, et al. "The extraordinary genus Myja is not a tergipedid, but related to the Facelinidae s. str. with the addition of two new species from Japan (Mollusca, Nudibranchia)." ZooKeys 818 (January 23, 2019): 89–116. https://doi.org/10.3897/zookeys.818.30477.

Full text

Abstract:

Morphological and molecular data are presented for the first time in an integrative way for the genus Myja Bergh, 1896. In accordance with the new molecular phylogenies, the traditional Facelinidae is paraphyletic. Herein is presented the phylogenetic placement of true Facelinidae s. str., including the first molecular data for F. auriculata (Müller, 1776), type species of the genus Facelina Alder & Hancock, 1855. The taxonomic history of F. auriculata is reviewed. The genus Myja is related to the clade Facelinidae s. str., but shows disparate morphological traits. Two new species of the g

APA, Harvard, Vancouver, ISO, and other styles

49

Tenau, Emanuel. "Dialektika Dunia Facebook dalam Pemikiran Peter L Berger. Suatu Studi Tentang Filsafat Budaya." Perspektif 13, no. 2 (2018): 113–29. http://dx.doi.org/10.69621/jpf.v13i2.109.

Full text

Abstract:

The world of facebook is the social phenomena of life in this era. Facebook does not only build a fraternal communication, but also has become a social problem. This essay tries to comprehend the dialectic phenomena of facebook from the phenomenological perspective of Peter L Berger. Berger perceives facebook as a dialectic process between the creator and the user of facebook or between the positive communication and the negative one. He looks into facebook in a systematic way with regard to dialectic relation between the structural fact and human act in reality. For Berger, facebook shows its

APA, Harvard, Vancouver, ISO, and other styles

50

Margenstern, Maurice. "The Domino Problem of the Hyperbolic Plane Is Undecidable: New Proof." Complex Systems 32, no. 1 (2023): 19–56. http://dx.doi.org/10.25088/complexsystems.32.1.19.

Full text

Abstract:

The present paper revisits the proof given in a paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is algorithmically unsolvable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is algorithmically unsolvable for the Euclidean plane, initially proved by Robert Berger in 1966. The present construction improves that of the 2008 paper. It also very strongly reduces the num

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!