Let $R$ be a discrete valuation ring, with valuation $v \colon R \twoheadrightarrow \mathbb{Z}_{\ge 0} \cup \{\infty\}$ and residue field $k$. Let $H$ be a hypersurface $\operatorname{Proj}(R[x_0,\ldots,x_n]/\langle f \rangle)$. Let $H_k$ be the special fiber, and let $(H_k)_{\mathrm{sing}}$ be its singular subscheme. Let $\Delta(f)$ be the discriminant of $f$. We use Zariski's main theorem and degeneration arguments to prove that $v(\Delta(f))=1$ if and only if $H$ is regular and $(H_k)_{\mathrm{sing}}$ consists of a nondegenerate double point over $k$. We also give lower bounds on $v(\Delta(f))$ when $H_k$ has multiple singularities or a positive-dimensional singularity.

Let $A$ be a finite non-abelian simple Mal'cev algebra, such as for example a finite simple non-abelian group or a finite simple non-zero ring. We show that the automorphism group of a filtered Boolean power of $A$ by the countable atomless Boolean algebra $A$ has ample generics. This uses the decomposition of that automorphism group as a semidirect product of a certain closure of a Boolean power of the automorphism group of $A$ by $B$ and the stabiliser of finitely many points in the homeomorphism group Homeo$2^\omega$ of the Cantor space $2^\omega$ by the authors. As an intermediate step, we show that pointwise stabilisers in Homeo$2^\omega$ have ample generics, which extends the result of Kwiatkowska that Homeo$2^\omega$ has ample generics.

We prove the density hypothesis for congruence subgroups of an irreducible uniform lattice in $\mathrm{PSL}_2(\mathbb{R})^d$, extending previous results on the spherical density hypothesis to bound multiplicities of non-tempered non-spherical representations. Our bounds are uniform in the level as well as the spectral parameters.

The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, solving systems of linear equations, and phase estimation, to name a few. The standard fault-tolerant implementation of an $n$-qubit unitary QFT approximates the desired transformation by removing small-angle controlled rotations and synthesizing the remaining ones into Clifford+T gates, incurring the T-count complexity of $O(n \log^2(n))$. In this paper, we show how to obtain approximate QFT with the T-count of $O(n \log(n))$. Our approach relies on quantum circuits with measurements and feedforward, and on reusing a special quantum state that induces the phase gradient transformation. We report asymptotic analysis as well as concrete circuits, demonstrating significant advantages in both theory and practice.

We study five pencils of projective quartic Delsarte K3 surfaces. Over finite fields, we give explicit formulas for the point counts of each family, written in terms of hypergeometric sums. Over the complex numbers, we match the periods of the corresponding family with hypergeometric differential operators and series. We also obtain a decomposition of the $L$-function of each pencil in terms of hypergeometric $L$-series and Dedekind zeta functions. This gives an explicit description of the hypergeometric motives geometrically realised by each pencil.

Let $T_{c,\beta}$ denote the smallest $t\ge1$ that a continuous, self-similar Gaussian process with self-similarity index \alpha>0 moves at least $\pm c t^\beta$ units. We prove that: (i) If \beta>\alpha, then $T_{c,\beta}=\infty$ with positive probability; (ii) If \beta<\alpha and $X$ is strongly locally nondeterministic in the sense of Pitt (1978), then $T_{c,\beta}$ has moments of all order; and (iii) If $\beta=\alpha$ and $X$ is strongly locally nondeterministic in the sense of Pitt (1978), then there exists a continuous, strictly decreasing function $\lambda:(0\,,\infty)\to(0\,,\infty)$ such that $\mathrm{E}(T_{c,\beta}^\mu)$ is finite when 0<\mu<\lambda(c) and infinite when \mu>\lambda(c). Together these results extend a celebrated theorem of Breiman (1967) and Shepp (1967) for passage times of a Brownian motion on the critical square-root boundary. We briefly discuss two examples: One about fractional Brownian motion, and another about a family of linear stochastic partial differential equations.

It has been conjectured in numerous physics papers that in ordinary first-passage percolation on integer lattices, the fluctuation exponent $\chi$ and the wandering exponent $\xi$ are related through the universal relation $\chi=2\xi -1$, irrespective of the dimension. This is sometimes called the KPZ relation between the two exponents. This article gives a rigorous proof of this conjecture assuming that the exponents exist in a certain sense.

This paper introduces a refinement of the sequent calculus approach called cirquent calculus. While in Gentzen-style proof trees sibling (or cousin, etc.) sequents are disjoint sequences of formulas, in cirquent calculus they are permitted to share elements. Explicitly allowing or disallowing shared resources and thus taking to a more subtle level the resource-awareness intuitions underlying substructural logics, cirquent calculus offers much greater flexibility and power than sequent calculus does. A need for substantially new deductive tools came with the birth of computability logic (see this http URL) - the semantically constructed formal theory of computational resources, which has stubbornly resisted any axiomatization attempts within the framework of traditional syntactic approaches. Cirquent calculus breaks the ice. Removing contraction from the full collection of its rules yields a sound and complete system for the basic fragment CL5 of computability logic. Doing the same in sequent calculus, on the other hand, throws out the baby with the bath water, resulting in the strictly weaker affine logic. An implied claim of computability logic is that it is CL5 rather than affine logic that adequately materializes the resource philosophy traditionally associated with the latter. To strengthen this claim, the paper further introduces an abstract resource semantics and shows the soundness and completeness of CL5 with respect to it.

In this paper, we prove that the first eigenfunction of the Laplacian for a horo-convex domain $\Omega\subset\mathbb H^n$ is super log-concave when $\text{diam}(\Omega)$ is not large. Our result is optimal in the sense that there are counterexamples %are constructed for the cases when $\Omega$ is not horo-convex or when $\text{diam}(\Omega)$ is large respectively

We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm in the form of a quantum computer program, we compile it into a high-level logical circuit that goes through multiple stages of decomposition into progressively lower-level circuits until we reach the physical execution-level specification. We skip the fault-tolerance layer, as it is not within the scope of this work. The different stages are structured so as to best assist with the overall optimization while taking into account numerous optimization criteria, including minimizing the number of expensive two-qubit gates, minimizing the number of less expensive single-qubit gates, optimizing the runtime, minimizing the overall circuit error, and optimizing classical control sequences. Our approach allows a trade-off between circuit runtime and quantum error, as well as to accommodate future changes in the optimization criteria that may likely arise as a result of the anticipated improvements in the physical-level control of the experiment.

Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure, simulating strongly-interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here, we describe a scalable co-design framework for solving chemistry problems on a trapped ion quantum computer, and apply it to compute the ground-state energy of the water molecule. The robust operation of the trapped ion quantum computer yields energy estimates with errors approaching the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics.

The recent negative answer to Hilbert's tenth problem over rings of integers relies on a theorem that for every extension of number fields $L/K$, if there is an abelian variety $A$ over $K$ such that 0 < \operatorname{rank} A(K) = \operatorname{rank} A(L), then $\mathcal{O}_K$ is $\mathcal{O}_L$-diophantine. We present an alternative proof of this theorem and review how it is used.

A quantum system may undergo undesired dynamics if it is already correlated with its environment before global unitary evolution takes place. To mitigate these effects, we apply local operations on the system of interest prior to the global evolution. This ensures that a specific dynamics-matching condition is satisfied - namely, that the system's dynamics can be U-generated starting from an initial product state. We review two strategies for achieving this: local measurements and local unitaries. For each, we outline their respective advantages and disadvantages and provide examples illustrating when the dynamics-matching condition can be satisfied. Since most operations inevitably alter the system's initial state, we optimize the fidelity between the original system state and the post-operation state, ensuring the condition can be met with minimal perturbation. Local measurements always guarantee that the system dynamics can be U-generated from a product state, but this comes at the cost of reduced fidelity. By contrast, local unitary transformations typically avoid this loss of fidelity: in our numerical study of 402 cases, they succeeded in nearly all instances, with a minimum fidelity of about 94.2%. We further strengthen these results by showing that a single unitary operation can prevent all non-completely positive quantum dynamics for a system and environment undergoing time-dependent global evolution. Moreover, we demonstrate that a general two-term Kraus channel - implementable with the addition of just one qubit - can raise all fidelities to 1 across the 402 cases, while still ensuring that the dynamics-matching condition is satisfied.

We introduce a framework for internal topological symmetries in quantum field theory, including "noninvertible symmetries" and "categorical symmetries". This leads to a calculus of topological defects which takes full advantage of well-developed theorems and techniques in topological field theory. Our discussion focuses on finite symmetries, and we give indications for a generalization to other symmetries. We treat quotients and quotient defects (often called "gauging" and "condensation defects"), finite electromagnetic duality, and duality defects, among other topics. We include an appendix on finite homotopy theories, which are often used to encode finite symmetries and for which computations can be carried out using methods of algebraic topology. Throughout we emphasize exposition and examples over a detailed technical treatment.

We prove the existence of murmurations in the family of Maass forms of weight 0 and level 1 with their Laplace eigenvalue parameter going to infinity (i.e., correlations between the parity and Hecke eigenvalues at primes growing in proportion to the analytic conductor).

I introduce batman, a Python package for modeling exoplanet transit light curves. The batman package supports calculation of light curves for any radially symmetric stellar limb darkening law, using a new integration algorithm for models that cannot be quickly calculated analytically. The code uses C extension modules to speed up model calculation and is parallelized with OpenMP. For a typical light curve with 100 data points in transit, batman can calculate one million quadratic limb-darkened models in 30 seconds with a single 1.7 GHz Intel Core i5 processor. The same calculation takes seven minutes using the four-parameter nonlinear limb darkening model (computed to 1 ppm accuracy). Maximum truncation error for integrated models is an input parameter that can be set as low as 0.001 ppm, ensuring that the community is prepared for the precise transit light curves we anticipate measuring with upcoming facilities. The batman package is open source and publicly available at this https URL .

Let $\Omega\subset\mathbb R^n$ be a Lipschitz domain, $K$ be a (bounded) ellipsoid centered at the origin and $H$ be the associated Wulff potential. We prove that, $\Omega$ satisfies the following Serrin-type overdetermined system $$u \in W^{1,2}(\mathbb R^n), \quad u=0\ \text{ a.e. in }\mathbb R^n\setminus \Omega,\quad \Delta_H u=\mathbf{c}\mathscr{H}^{n-1}|_{\partial^*\Omega} - \mathbf{1}_{\Omega}\,dx,$$ in the weak sense if and only if $\Omega$ is homothetic to $K$. Here $\Delta_H$ denotes the anisotropic Laplacian associated to $H$, and $\mathscr H^{n-1}$ denotes the $(n-1)$-dimensional Hausdorff measure. Our approach offers an alternative proof to [11] in the case of Lipschitz domains, introducing a novel viewpoint to settle [13, Question 7.1].