Search results for " Mathematica"
showing 10 items of 689 documents
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
2015
In the k-junta testing problem, a tester has to efficiently decide whether a given function f: {0, 1}n → {0, 1} is a k-junta (i.e., depends on at most fc of its input bits) or is ε-far from any k-junta. Our main result is a quantum algorithm for this problem with query complexity Õ([EQUATION]) and time complexity Õ(n[EQUATION]). This quadratically improves over the query complexity of the previous best quantum junta tester, due to Atıcı and Servedio. Our tester is based on a new quantum algorithm for a gapped version of the combinatorial group testing problem, with an up to quartic improvement over the query complexity of the best classical algorithm. For our upper bound on the time complex…
RationalizeRoots: Software Package for the Rationalization of Square Roots
2019
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.
Splicing Systems from Past to Future: Old and New Challenges
2014
A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will concentrate on a specific behaviour of a type of splicing systems, introduced by P\u{a}un and subsequently developed by many researchers in both linear and circular case of splicing definition. In particular, we will present recent results on this topic and how they stimulate new challenging investigations.
Fast MATLAB assembly of FEM matrices in 2D and 3D: Edge elements
2014
We propose an effective and flexible way to assemble finite element stiffness and mass matrices in MATLAB. We apply this for problems discretized by edge finite elements. Typical edge finite elements are Raviart-Thomas elements used in discretizations of H(div) spaces and Nedelec elements in discretizations of H(curl) spaces. We explain vectorization ideas and comment on a freely available MATLAB code which is fast and scalable with respect to time.
A New Nonparametric Estimate of the Risk-Neutral Density with Applications to Variance Swaps
2021
We develop a new nonparametric approach for estimating the risk-neutral density of asset prices and reformulate its estimation into a double-constrained optimization problem. We evaluate our approach using the S\&P 500 market option prices from 1996 to 2015. A comprehensive cross-validation study shows that our approach outperforms the existing nonparametric quartic B-spline and cubic spline methods, as well as the parametric method based on the Normal Inverse Gaussian distribution. As an application, we use the proposed density estimator to price long-term variance swaps, and the model-implied prices match reasonably well with those of the variance future downloaded from the CBOE websi…
Lines on K3 quartic surfaces in characteristic 2
2016
We prove that a K3 quartic surface defined over a field of characteristic 2 can contain at most 68 lines. If it contains 68 lines, then it is projectively equivalent to a member of a 1-dimensional family found by Rams and Sch\"utt.
The prime graph on class sizes of a finite group has a bipartite complement
2020
Abstract Let G be a finite group, and let cs ( G ) denote the set of sizes of the conjugacy classes of G. The prime graph built on cs ( G ) , that we denote by Δ ( G ) , is the (simple undirected) graph whose vertices are the prime divisors of the numbers in cs ( G ) , and two distinct vertices p, q are adjacent if and only if pq divides some number in cs ( G ) . A rephrasing of the main theorem in [8] is that the complement Δ ‾ ( G ) of the graph Δ ( G ) does not contain any cycle of length 3. In this paper we generalize this result, showing that Δ ‾ ( G ) does not contain any cycle of odd length, i.e., it is a bipartite graph. In other words, the vertex set V ( G ) of Δ ( G ) is covered b…
Bounding the number of vertices in the degree graph of a finite group
2020
Abstract Let G be a finite group, and let cd ( G ) denote the set of degrees of the irreducible complex characters of G . The degree graph Δ ( G ) of G is defined as the simple undirected graph whose vertex set V ( G ) consists of the prime divisors of the numbers in cd ( G ) , two distinct vertices p and q being adjacent if and only if pq divides some number in cd ( G ) . In this note, we provide an upper bound on the size of V ( G ) in terms of the clique number ω ( G ) (i.e., the maximum size of a subset of V ( G ) inducing a complete subgraph) of Δ ( G ) . Namely, we show that | V ( G ) | ≤ max { 2 ω ( G ) + 1 , 3 ω ( G ) − 4 } . Examples are given in order to show that the bound is bes…
On sigma-subnormal subgroups of factorised finite groups
2020
Abstract Let σ = { σ i : i ∈ I } be a partition of the set P of all prime numbers. A subgroup X of a finite group G is called σ-subnormal in G if there is chain of subgroups X = X 0 ⊆ X 1 ⊆ ⋯ ⊆ X n = G with X i − 1 normal in X i or X i / C o r e X i ( X i − 1 ) is a σ i -group for some i ∈ I , 1 ≤ i ≤ n . In the special case that σ is the partition of P into sets containing exactly one prime each, the σ-subnormality reduces to the familiar case of subnormality. If a finite soluble group G = A B is factorised as the product of the subgroups A and B, and X is a subgroup of G such that X is σ-subnormal in 〈 X , X g 〉 for all g ∈ A ∪ B , we prove that X is σ-subnormal in G. This is an extension…
Degrees of rational characters of finite groups
2010
Abstract A classical theorem of John Thompson on character degrees states that if the degree of any complex irreducible character of a finite group G is 1 or divisible by a prime p, then G has a normal p-complement. In this paper, we consider fields of values of characters and prove some improvements of this result.