English
Related papers

Related papers: Higher Kurtz randomness

200 papers

We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…

Algebraic Geometry · Mathematics 2022-02-15 Alessandra Bernardi , Reynaldo Staffolani

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…

Discrete Mathematics · Computer Science 2018-03-30 Jan Dreier , Philipp Kuinke , Peter Rossmanith

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

Probability · Mathematics 2007-11-20 Kevin P. Costello , Van Vu

In a one-parameter model for evolution of random trees, which also includes the Barabasi-Albert random tree, almost sure behavior and the limiting distribution of the degree of a vertex in a fixed position are examined. Results about Polya…

Probability · Mathematics 2010-07-27 Agnes Backhausz

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Number Theory · Mathematics 2007-05-23 Arnaud Bodin , Pierre Dèbes , Salah Najib

We show that if $A$ is a closed subset of the Heisenberg group whose vertical projections are nowhere dense, then the complement of $A$ is quasiconvex. In particular, closed sets which are null sets for the cc-Hausdorff $3$-measure have…

Metric Geometry · Mathematics 2017-05-18 David A. Herron , Anton Lukyanenko , Jeremy T. Tyson

Employing the currently discussed notion of pseudo-Hermiticity, we define a pseudo-unitary group. Further, we develop a random matrix theory which is invariant under such a group and call this ensemble of pseudo-Hermitian random matrices as…

Quantum Physics · Physics 2009-11-07 Zafar Ahmed , Sudhir R. Jain

We study the problem of constructing a (near) uniform random proper $q$-coloring of a simple $k$-uniform hypergraph with $n$ vertices and maximum degree $\Delta$. (Proper in that no edge is mono-colored and simple in that two edges have…

Discrete Mathematics · Computer Science 2017-11-15 Michael Anastos , Alan Frieze

We define upper bound and lower bounds for order-preserving homogeneous of degree one maps on a proper closed cone in $\R^n$ in terms of the cone spectral radius. We also define weak upper and lower bounds for these maps. For a proper…

Dynamical Systems · Mathematics 2012-06-01 Philip Chodrow , Cole Franks , Brian Lins

Let D = { d_n } be a countable collection of Delta^1_3 degrees. Assuming that all co-analytic games on integers are determined (or equivalently that all reals have ``sharps''), we prove that either D has a Delta^1_3-minimal upper bound, or…

Logic · Mathematics 2016-09-06 Philip Welch

Let $f$ be a homeomorphism of the closed annulus $A$ isotopic to the identity, and let $X\subset {\rm Int}A$ be an $f$-invariant continuum which separates $A$ into two domains, the upper domain $U_+$ and the lower domain $U_-$. Fixing a…

Dynamical Systems · Mathematics 2011-04-22 Shigenori Matsumoto

We consider a seemingly weaker form of $\Delta^1_1$ Turing determinacy. Let $2 \leq \rho < \omega_1^{\textrm{CK}}$, $\textrm{Weak-Turing-Det}_\rho (\Delta^1_1)$ is the statement: Every $\Delta^1_1$ set of reals cofinal in the Turing degrees…

Logic · Mathematics 2022-06-20 Ramez L. Sami

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is…

Formal Languages and Automata Theory · Computer Science 2019-07-29 Kitti Gelle , Szabolcs Ivan

Continuing the study of Hamiltonian pseudo-rotations of projective spaces, we focus on the conjecture that the fixed-point data set (the actions and the linearized flows at one-periodic orbits) of a pseudo-rotation exactly matches that data…

Symplectic Geometry · Mathematics 2021-01-12 Viktor L. Ginzburg , Basak Z. Gurel

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

Combinatorics · Mathematics 2024-10-07 Gabriel Crudele , Peter Dukes , Jonathan A. Noel

We study the extremes of a sequence of random variables $(R_n)$ defined by the recurrence $R_n=M_nR_{n-1}+q$, $n\ge1$, where $R_0$ is arbitrary, $(M_n)$ are iid copies of a non--degenerate random variable $M$, $0\le M\le1$, and $q>0$ is a…

Probability · Mathematics 2011-06-22 Pawel Hitczenko

With $\xi$ the number of triangles in the usual (Erd\H{o}s-R\'enyi) random graph $G(m,p)$, $p>1/m$ and $\eta>0$, we show (for some $C_{\eta}>0$) $$\Pr(\xi> (1+\eta)\E \xi) < \exp[-C_{\eta}\min{m^2p^2\log(1/p),m^3p^3}].$$ This is tight up to…

Probability · Mathematics 2011-11-30 Bobby DeMarco , Jeff Kahn

The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…

Logic · Mathematics 2013-05-01 Uri Andrews , Isaac Goldbring , H. Jerome Keisler

We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…

Probability · Mathematics 2022-07-12 Philip Lamkin , Tomasz Tkocz

To each discrete product system E of finite-dimensional Hilbert spaces we associate a C*-algebra O_E. When E is the n-dimensional product system over N, O_E is the Cuntz algebra O_n, and the irrational rotation algebras appear as O_E for…

Operator Algebras · Mathematics 2007-05-23 Neal J. Fowler