Episciences,
revues en libre accès
Plateforme d’édition et de publication scientifiques en accès ouvert diamant couvrant toutes les disciplines
Notre mission
Proposer à la fois un outil innovant, intégré dans l’écosystème européen pour la diffusion des contenus, et un accompagnement éditorial
En savoir plus
5 409
articles et comptes-rendus
26
revues en accès ouvert diamant
11 355
utilisateurs et utilisatrices
Dernières publications
Voir toutes les revuesMathématiques
CM
[Communications in Mathematics]
CM
Communications in Mathematics
Existant depuis 2009, Communications in Mathematics est la continuation de la revue Acta Mathematica et Informatica Universitatis Ostraviensis, fondée en 1993, devenue Acta Mathematica Universitatis Ostraviensis en 2003. Communications in Mathematics publie en anglais des articles de recherche et d’étude dans tous les domaines des mathématiques pures et appliquées, de la physique mathématique et de l’informatique.
- Directeur de la publication : Jan Lata
- Rédacteur en chef : Ivan Kaygorodov
- Type de support : électronique
- Périodicité : annuelle
- Année de création : 2009
- Date de mise en ligne sur Episciences : 2021
- eISSN : 2336-1298
- Disciplines : mathématiques
- Langues de publication : anglais
- Procédure d’évaluation : simple aveugle
- Licence CC BY-SA 4.0
- Éditeur : University of Ostrava
- Adresse postale : Dvořákova 7, 701 03 Ostrava
- Pays : République tchèque
- Contact : cm AT episciences.org
Derniers articles
Structure of finite groups with restrictions on the set of conjugacy classes sizes
Let $N(G)$ be the set of conjugacy classes sizes of $G$. We prove that if $N(G)=\Omega\times \{1,n\}$ for specific set $\Omega$ of integers, then $G\simeq A\times B$ where $N(A)=\Omega$, $N(B)=\{1,n\}$, and $n$ is a power of prime.
Gorshkov, Ilya
03 février 2023
Lire l'article
Various notions of (co)simplicial (pre)sheaves
The phrase "(co)simplicial (pre)sheaf" can be reasonably interpreted in multiple ways. In this survey we study how the various notions familiar to the author relate to one another. We end by giving some example applications of the most general of these notions.
Hosgood, Timothy
27 janvier 2023
Lire l'article
Sciences humaines et sociales
J. Philos. Econ.
[Journal of Philosophical Economics]
J. Philos. Econ.
Journal of Philosophical Economics
Journal of Philosophical Economics est une revue de sciences sociales créée en 2007. Éditée par Editura ASE, J. Philos. Econ. publie un volume par an contenant des articles et des recensions d’ouvrages en allemand, anglais ou français.
- Directrice de la publication : Dr. Simona Bușoi
- Rédacteur en chef : Valentin Cojanu
- Type de support : papier et électronique
- Périodicité : annuelle
- Année de création : 2007
- Date de mise en ligne sur Episciences : 2021
- eISSN : 1844-8208
- Disciplines : économie, philosophie, sciences sociales
- Langues de publication : allemand, anglais, français
- Procédure d’évaluation : simple aveugle
- Licence CC BY-NC-SA 4.0
- Éditeur : Editura ASE
- Adresse postale : Academia de Studii Economice Bucuresti, Piata Romana 6, 010374 Bucarest
- Pays : Roumanie
- Contact : jpe AT episciences.org
Derniers articles
Towards a Theory of Conversation in Political Economy
The paper analyzes the nature of Political Economy as a modern conversational style, by defining its logical and rhetoric features. Successively, a wider historical and political context linked to the birth of the discipline is taken into account and thoroughly introduced in its implications for the interpretation of the role of such a discipline in modern life. Finally Political Economy is examined under the light of the educational effort it requires, as an anti- rhetoric method of inquiry and dialogue.
Faella, Gian Paolo
31 janvier 2023
Lire l'article
Nietzsche and Fractal Geometry: a philosophical continuity
The purpose of this work is to highlight the epistemological proximity between Nietzsche’s philosophy of science and the underlying philosophical principles of fractal geometry, as illustrated in the main work of its creator, French mathematician Benoit Mandelbrot.This work also aims to find the end of this philosophical continuity, finding an important divergence between Nietzsche’s philosophy of risk taking and Mandelbrot’s legacy in risk management.
Gualario, Leandro
20 janvier 2023
Lire l'article
Informatique et mathématiques appliquées
TheoretiCS
TheoretiCS
Créée en 2021, TheoretiCS couvre tous les domaines de l’informatique théorique (Theoretical Computer Science, TCS). Effort conjoint de la communauté TCS, la revue est publiée par la Fondation TheoretiCS, une organisation à but non lucratif située en Allemagne. La revue publie au fil de l’eau des travaux de recherche en anglais incluant des versions révisées et étendues d’articles de conférences.
- Directeur de la publication : Thomas Schwentick
- Rédacteurs en chef : Javier Esparza ; Uri Zwick
- Type de support : électronique
- Périodicité : au fil de l’eau
- Année de création : 2021
- Date de mise en ligne sur Episciences : 2021
- eISSN : 2751-4838
- Disciplines : informatique théorique
- Langue de publication : anglais
- Procédure d’évaluation : simple aveugle
- Licence CC BY 4.0
- Éditeur : TheoretiCS Foundation e.V.
- Adresse postale : c/o Thomas Schwentick – Schillingstr. 23, D-44139 Dortmund
- Pays : Allemagne
- Contact : theoretics AT episciences.org
Derniers articles
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems. This important application motivates the question of strategy complexity: which valuations (or payoff functions) admit optimal positional strategies (without memory)? Valuations for which both players have optimal positional strategies have been characterized by Gimbert and Zielonka for finite graphs and by Colcombet and Niwi\'nski for infinite graphs. However, for reactive synthesis, existence of optimal positional strategies for the opponent (which models an antagonistic environment) is irrelevant. Despite this fact, not much is known about valuations for which the protagonist admits optimal positional strategies, regardless of the opponent. In this work, we characterize valuations which admit such strategies over infinite game graphs. Our characterization uses the vocabulary of universal graphs, which has also proved useful in understanding recent breakthrough results regarding the complexity of parity games. More precisely, we show that a valuation admitting universal graphs which are monotone and well-ordered is positional over all game graphs, and -- more surprisingly -- that the converse is also true for valuations admitting neutral colors. We prove the applicability and elegance of the framework by unifying a number of known positionality results, proving new ones, and establishing closure under lexicographical products. Finally, we discuss a class of prefix-independent positional objectives which is closed under countable unions.
Ohlmann, Pierre
31 janvier 2023
Lire l'article
Conditional Dichotomy of Boolean Ordered Promise CSPs
Promise Constraint Satisfaction Problems (PCSPs) are a generalization of Constraint Satisfaction Problems (CSPs) where each predicate has a strong and a weak form and given a CSP instance, the objective is to distinguish if the strong form can be satisfied vs. even the weak form cannot be satisfied. Since their formal introduction by Austrin, Guruswami, and H\aa stad, there has been a flurry of works on PCSPs [BBKO19,KO19,WZ20]. The key tool in studying PCSPs is the algebraic framework developed in the context of CSPs where the closure properties of the satisfying solutions known as the polymorphisms are analyzed. The polymorphisms of PCSPs are much richer than CSPs. In the Boolean case, we still do not know if dichotomy for PCSPs exists analogous to Schaefer's dichotomy result for CSPs. In this paper, we study a special case of Boolean PCSPs, namely Boolean Ordered PCSPs where the Boolean PCSPs have the predicate $x \leq y$. In the algebraic framework, this is the special case of Boolean PCSPs when the polymorphisms are monotone functions. We prove that Boolean Ordered PCSPs exhibit a computational dichotomy assuming the Rich 2-to-1 Conjecture [BKM21] which is a perfect completeness surrogate of the Unique Games Conjecture. Assuming the Rich 2-to-1 Conjecture, we prove that a Boolean Ordered PCSP can be solved in polynomial time if for every $\epsilon>0$, it has polymorphisms where each coordinate has Shapley value at most $\epsilon$, else it is NP-hard. The algorithmic part of our dichotomy is based on a structural lemma that Boolean monotone functions with each coordinate having low Shapley value have arbitrarily large threshold functions as minors. The hardness part proceeds by showing that the Shapley value is consistent under a uniformly random 2-to-1 minor. Of independent interest, we show that the Shapley value can be inconsistent under an adversarial 2-to-1 minor.
Brakensiek, Joshua
25 janvier 2023
Lire l'article