相关论文: Coding with ladders a well-ordering of the reals
Extensions of real numbers in more than two dimensions, in particular quaternions and octonions are finding applications in physics due to the fact that they naturally capture certain symmetries of physical systems. Here it is shown that…
We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for…
Fractional difference equations provide a flexible mathematical framework for modeling complex systems with memory, hereditary, and non-local effects. In this work, we study the stability of higher-order two-term fractional linear…
The paper aims at constructing two different solutions to an elliptic system $$ u \cdot \nabla u + (-\Delta)^m u = \lambda F $$ defined on the two dimensional torus. It can be viewed as an elliptic regularization of the stationary Burgers…
We present a general procedure for applying the scale-setting prescription of Brodsky, Lepage and Mackenzie to higher orders in the strong coupling constant $\alphas$. In particular, we show how to apply this prescription when the leading…
By forcing with $\mathbb{P}_{\rm max}$ over strong models of determinacy, we obtain models where different square principles at $\omega_2$ and $\omega_3$ fail. In particular, we obtain a model of $2^{\aleph_0}=2^{\aleph_1}=\aleph_2 +…
Write $\mathrm{ord}_p(\cdot)$ for the multiplicative order in $\mathbb{F}_p^{\times}$. Recently, Matthew Just and the second author investigated the problem of classifying pairs $\alpha, \beta \in \mathbb{Q}^{\times}\setminus\{\pm 1\}$ for…
Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. In this paper, we evaluate the performance of different test pattern sets using three methods. For test pattern sets with a certain structure…
Lie systems form a class of systems of first-order ordinary differential equations whose general solutions can be described in terms of certain finite families of particular solutions and a set of constants, by means of a particular type of…
Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…
We give partial answers to the following question: if $F$ is an $m$ by $m$ matrix on $\mathbb{R}^n$ satisfying a second order linear elliptic equation, does $\det F$ satisfy the strong unique continuation property? We give counterexamples…
In the 1970s M. Laczkovich posed the following problem: Let $\mathcal{B}_1(X)$ denote the set of Baire class $1$ functions defined on an uncountable Polish space $X$ equipped with the pointwise ordering. \[\text{Characterize the order types…
In this work, we introduce a framework to study the effect of random operations on the combinatorial list-decodability of a code. The operations we consider correspond to row and column operations on the matrix obtained from the code by…
We show that the supremum of the lengths of boldface Delta-1-2 prewellorderings of the reals can be Aleph-2, with Aleph-1 inac- cessible to reals, assuming only the consistency of an inaccessible.
We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…
An algorithm for solving first order ODEs, by systematically determining symmetries of the form [ xi = F(x), eta = P(x) y + Q(x) ], where xi d/dx + eta d/dy is the symmetry generator - is presented. To these {\it linear} symmetries one can…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
Four algorithms giving rise to graceful graphs from a known (non)graceful graph are described. Some necessary conditions for a graph to be highly graceful and critical are given. Finally some conjectures are made on graceful, critical and…
We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating…
In a recent paper on exotic crossed products, we included a lemma concerning ideals of the Fourier-Stieltjes algebra. Buss, Echterhoff, and Willett have pointed out to us that our proof of this lemma contains an error. In fact, it remains…