Results 1 to 10 of about 4,294,594 (157)
Asymptotic freeness in tracial ultraproducts [PDF]
Forum of Mathematics, Sigma, 2023 We prove novel asymptotic freeness results in tracial ultraproduct von Neumann algebras. In particular, we show that whenever $M = M_1 \ast M_2$ is a tracial free product von Neumann algebra and $u_1 \in \mathscr U(M_1)$ , $u_2 \in ...
Cyril Houdayer, Adrian Ioana
doaj +2 more sources
More Structural Characterizations of Some Subregular Language Families by Biautomata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few.
Markus Holzer, Sebastian Jakobi
doaj +4 more sources
On the freeness of anticyclotomic selmer groups of modular forms [PDF]
, 2016 We establish the freeness of certain anticyclotomic Selmer groups of modular forms. The freeness of these Selmer groups plays a key role in the Euler system arguments introduced by Bertolini and Darmon in their work on the anticyclotomic main conjecture ...
Kim, C., Pollack, R., Weston, T.
core +2 more sources
Guaranteeing Envy-Freeness under Generalized Assignment Constraints [PDF]
ACM Conference on Economics and Computation, 2023 We study fair division of goods under the broad class of generalized assignment constraints. In this constraint framework, the sizes and values of the goods are agent-specific, and one needs to allocate the goods among the agents fairly while further ...
Siddharth Barman +3 more
semanticscholar +1 more source
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations [PDF]
International Joint Conference on Artificial Intelligence, 2022 We study the problem of allocating indivisible goods among agents in a fair manner. While envy-free allocations of indivisible goods are not guaranteed to exist, envy-freeness can be achieved by additionally providing some subsidy to the agents.
Siddharth Barman +3 more
semanticscholar +1 more source
Freeness of type B and conditional freeness for random matrices [PDF]
Indiana University Mathematics Journal, 2022 The asymptotic freeness of independent unitarily invariant $N\times N$ random matrices holds in expectation up to $O(N^{-2})$. An already known consequence is the infinitesimal freeness in expectation. We put in evidence another consequence for unitarily
Guillaume C'ebron +2 more
semanticscholar +1 more source
On (non-) freeness of some tridendriform algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We present some results on the freeness or non freeness of some tridendriform algebras. In particular, we give a combinatorial proof of the freeness of WQSym, an algebra based on packed words, result already known with an algebraic proof.
Vincent Vong
doaj +1 more source
Computing the nonfree locus of the moduli space of arrangements and Terao's freeness conjecture [PDF]
Mathematics of Computation, 2021 In this paper, we show how to compute using Fitting ideals the nonfree locus of the moduli space of arrangements of a rank $3$ simple matroid, i.e., the subset of all points of the moduli space which parametrize nonfree arrangements.
Mohamed Barakat, Lukas Kühne
semanticscholar +1 more source
Effect of alkaline pre-treatment on physical, optical and mechanical properties of semi-chemical NSSC wheat straw pulp [PDF]
تحقیقات علوم چوب و کاغذ ایران, 2013 In this study the effect of alkaline pretreatment with 1% NaOH on physical, optical and mechanical properties and refining of NSSC (Neutral Sulfite Semi Chemical) wheat straw pulp were investigated.
Soodeh Zhand +3 more
doaj +1 more source
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings [PDF]
AAAI Conference on Artificial Intelligence, 2020 Envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations.
Alireza Farhadi +4 more
semanticscholar +1 more source