Physicalism UnBlocked

2020 ◽  
Vol 50 (7) ◽  
pp. 890-904
Author(s):  
D. Gene Witmer
Keyword(s):  
Independent Interest ◽  
Supervenience Thesis

AbstractWhat has become known as the blockers problem is an alleged difficulty facing attempts to formulate physicalism as a supervenience thesis. A blocker is an entity, itself contrary to physicalism, with the power to disrupt an otherwise necessary connection between physical and nonphysical conditions. I argue that there is no distinct blockers problem. Insofar as a problem can be identified, it turns out to be just a rather baroque version of a distinct and familiar objection to supervenience formulations and to be of no independent interest. Work on the formulation of physicalism can thus proceed without worrying about blockers.

A system of functions biorthogonal with the derivatives of Chebyshev second-kind polynomials of a complex variable

2020 ◽  
Vol 17 (2) ◽  
pp. 256-277
Author(s):  
Ol'ga Veselovska ◽  
Veronika Dostoina
Keyword(s):  
Complex Plane ◽  
Complex Variable ◽  
Analytic Functions ◽  
Combinatorial Identities ◽  
Independent Interest ◽  
Closed Curves ◽  
In Series ◽  
Derivatives Of

For the derivatives of Chebyshev second-kind polynomials of a complex vafiable, a system of functions biorthogonal with them on closed curves of the complex plane is constructed. Properties of these functions and the conditions of expansion of analytic functions in series in polynomials under consideration are established. The examples of such expansions are given. In addition, we obtain some combinatorial identities of independent interest.

Flat functors and classifying toposes

2018 ◽  
Author(s):  
Olivia Caramello
Keyword(s):  
General Theory ◽  
Geometric Theory ◽  
Small Category ◽  
Independent Interest ◽  
Yoneda Lemma ◽  
Geometric Morphisms ◽  
The Way

This chapter develops a general theory of extensions of flat functors along geometric morphisms of toposes; the attention is focused in particular on geometric morphisms between presheaf toposes induced by embeddings of categories and on geometric morphisms to the classifying topos of a geometric theory induced by a small category of set-based models of the latter. A number of general results of independent interest are established on the way, including developments on colimits of internal diagrams in toposes and a way of representing flat functors by using a suitable internalized version of the Yoneda lemma. These general results will be instrumental for establishing in Chapter 6 the main theorem characterizing the class of geometric theories classified by a presheaf topos and for applying it.

scholarly journals Jordan products of quantum channels and their compatibility

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Mark Girard ◽  
Martin Plávala ◽  
Jamie Sikora
Keyword(s):  
Quantum State ◽  
Sufficient Conditions ◽  
The Other ◽  
Independent Interest ◽  
Quantum Channels ◽  
Semidefinite Programs ◽  
Jordan Product ◽  
Marginal Problem ◽  
Jordan Products ◽  
Product Of Matrices

AbstractGiven two quantum channels, we examine the task of determining whether they are compatible—meaning that one can perform both channels simultaneously but, in the future, choose exactly one channel whose output is desired (while forfeiting the output of the other channel). Here, we present several results concerning this task. First, we show it is equivalent to the quantum state marginal problem, i.e., every quantum state marginal problem can be recast as the compatibility of two channels, and vice versa. Second, we show that compatible measure-and-prepare channels (i.e., entanglement-breaking channels) do not necessarily have a measure-and-prepare compatibilizing channel. Third, we extend the notion of the Jordan product of matrices to quantum channels and present sufficient conditions for channel compatibility. These Jordan products and their generalizations might be of independent interest. Last, we formulate the different notions of compatibility as semidefinite programs and numerically test when families of partially dephasing-depolarizing channels are compatible.

Time and Duration in Noninterleaving Concurrency

1993 ◽  
Vol 19 (3-4) ◽  
pp. 403-416
Author(s):  
David Murphy
Keyword(s):  
Partial Order ◽  
Independent Interest ◽  
Underlying Event ◽  
Strict Partial Order ◽  
Event Structures ◽  
Concurrency Theory ◽  
Finite Structures

The purpose of this paper is to present a real-timed concurrency theory in the noninterleaving tradition. The theory is based on the occurrences of actions; each occurrence or event has a start and a finish. Causality is modelled by assigning a strict partial order to these starts and finishes, while timing is modelled by giving them reals. The theory is presented in some detail. All of the traditional notions found in concurrency theories (such as conflict, confusion, liveness, and so on) are found to be expressible. Four notions of causality arise naturally from the model, leading to notions of securing. Three of the notions give rise to underlying event structures, demonstrating that our model generalises Winskel’s. Infinite structures are then analysed: a poset of finite structures is defined and suitably completed to give one containing infinite structures. These infinite structures are characterised as just those arising as limits of finite ones. Our technique here, which relies on the structure of time, is of independent interest.

scholarly journals Dispersive Estimates for Full Dispersion KP Equations

2021 ◽  
Vol 23 (1) ◽  
Author(s):  
Didier Pilod ◽  
Jean-Claude Saut ◽  
Sigmund Selberg ◽  
Achenef Tesfahun
Keyword(s):  
Stationary Phase ◽  
Initial Value Problem ◽  
Bessel Functions ◽  
Linear Part ◽  
Independent Interest ◽  
Phase Method ◽  
Stationary Phase Method ◽  
Initial Value ◽  
Kp Equations ◽  
Well Posed

AbstractWe prove several dispersive estimates for the linear part of the Full Dispersion Kadomtsev–Petviashvili introduced by David Lannes to overcome some shortcomings of the classical Kadomtsev–Petviashvili equations. The proof of these estimates combines the stationary phase method with sharp asymptotics on asymmetric Bessel functions, which may be of independent interest. As a consequence, we prove that the initial value problem associated to the Full Dispersion Kadomtsev–Petviashvili is locally well-posed in $$H^s(\mathbb R^2)$$ H s ( R 2 ) , for $$s>\frac{7}{4}$$ s > 7 4 , in the capillary-gravity setting.

scholarly journals Rational points on linear slices of diagonal hypersurfaces

2015 ◽  
Vol 218 ◽  
pp. 51-100
Author(s):  
Jörg Brüdern ◽  
Olivier Robert
Keyword(s):  
Asymptotic Formula ◽  
Rational Points ◽  
Independent Interest ◽  
The Way ◽  
Hardy Littlewood Method

AbstractAn asymptotic formula is obtained for the number of rational points of bounded height on the class of varieties described in the title line. The formula is proved via the Hardy-Littlewood method, and along the way we establish two new results on Weyl sums that are of some independent interest.

Quantum lower bound for recursive Fourier sampling

2003 ◽  
Vol 3 (2) ◽  
pp. 165-174
Author(s):  
S. Aaronson
Keyword(s):  
Lower Bound ◽  
Quantum Algorithm ◽  
Independent Interest ◽  
Classical Algorithm ◽  
Fourier Sampling ◽  
Adversary Method

We revisit the oft-neglected `recursive Fourier sampling' (RFS) problem, introduced by Bernstein and Vazirani to prove an oracle separation between BPP and BQP. We show that the known quantum algorithm for RFS is essentially optimal, despite its seemingly wasteful need to uncompute information. This implies that, to place \mathsf{BQP} outside of PH[\log] relative to an oracle, one would need to go outside the RFS framework. Our proof argues that, given any variant of RFS, either the adversary method of Ambainis yields a good quantum lower bound, or else there is an efficient classical algorithm. This technique may be of independent interest.

Subgroups of Finite Index in Free Groups

1949 ◽  
Vol 1 (2) ◽  
pp. 187-190 ◽  
Author(s):  
Marshall Hall
Keyword(s):  
Free Group ◽  
Finite Index ◽  
Free Groups ◽  
Recursion Formula ◽  
Independent Interest ◽  
Finiteness Conditions ◽  
Total Length ◽  
Free Generators

This paper has as its chief aim the establishment of two formulae associated with subgroups of finite index in free groups. The first of these (Theorem 3.1) gives an expression for the total length of the free generators of a subgroup U of the free group Fr with r generators. The second (Theorem 5.2) gives a recursion formula for calculating the number of distinct subgroups of index n in Fr.Of some independent interest are two theorems used which do not involve any finiteness conditions. These are concerned with ways of determining a subgroup U of F.

scholarly journals Ruin probability with certain stationary stable claims generated by conservative flows

2007 ◽  
Vol 39 (02) ◽  
pp. 360-384 ◽  
Author(s):  
Uğur Tuncay Alparslan ◽  
Gennady Samorodnitsky
Keyword(s):  
Markov Chains ◽  
Discrete Time ◽  
Continuous Time ◽  
Ruin Probability ◽  
Stable Process ◽  
Independent Interest ◽  
Stable Processes ◽  
Auxiliary Result ◽  
Initial Capital ◽  
Order Of Magnitude

We study the ruin probability where the claim sizes are modeled by a stationary ergodic symmetric α-stable process. We exploit the flow representation of such processes, and we consider the processes generated by conservative flows. We focus on two classes of conservative α-stable processes (one discrete-time and one continuous-time), and give results for the order of magnitude of the ruin probability as the initial capital goes to infinity. We also prove a solidarity property for null-recurrent Markov chains as an auxiliary result, which might be of independent interest.

Hierarchical Identity-Based Signature in Polynomial Rings

2020 ◽  
Vol 63 (10) ◽  
pp. 1490-1499
Author(s):  
Zhichao Yang ◽  
Dung H Duong ◽  
Willy Susilo ◽  
Guomin Yang ◽  
Chao Li ◽  
...  
Keyword(s):  
Higher Dimensions ◽  
Polynomial Rings ◽  
Independent Interest ◽  
Private Key ◽  
Large Community ◽  
New Construction ◽  
Identity Based ◽  
And Storage ◽  
New Algorithms ◽  
Core Role

Abstract Hierarchical identity-based signature (HIBS) plays a core role in a large community as it significantly reduces the workload of the root private key generator. To make HIBS still available and secure in post-quantum era, constructing lattice-based schemes is a promising option. In this paper, we present an efficient HIBS scheme in polynomial rings. Although there are many lattice-based signatures proposed in recent years, to the best of our knowledge, our HIBS scheme is the first ring-based construction. In the center of our construction are two new algorithms to extend lattice trapdoors to higher dimensions, which are non-trivial and of independent interest. With these techniques, the security of the new scheme can be proved, assuming the hardness of the Ring-SIS problem. Since operations in the ring setting are much faster than those over integers and the new construction is the first ring-base HIBS scheme, our scheme is more efficient and practical in terms of computation and storage cost when comparing to the previous constructions.

Sign in / Sign up

Export Citation Format

Share Document