Publication

Synthesis of 3,3-disubstituted oxindoles by one-pot integrated Brønsted base-catalyzed trichloroacetimidation of 3-hydroxyoxindoles and Brønsted acid-catalyzed nucleophilic substitution reaction

2013
Journal Articles

Abstract

Treatment of 3-hydroxyoxindoles with trichloroacetonitrile (1.3 equiv.) and a catalytic amount of DBU (0.1 equiv.) followed by addition of nucleophiles (1.5 equiv.) and diphenylphosphoric acid (0.2 equiv.) afforded the 3,3-disubstituted oxindoles in good to excellent yields. DFT computations supported the notion that the reaction went through the 1-alkyl-2-oxo-2H-indol-1-ium intermediate.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2013
Journal Articles

Abstract

Official source

Related concepts (9)

Discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.

Fast Fourier transform

A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical.

Multidimensional discrete convolution

In signal processing, multidimensional discrete convolution refers to the mathematical operation between two functions f and g on an n-dimensional lattice that produces a third function, also of n-dimensions. Multidimensional discrete convolution is the discrete analog of the multidimensional convolution of functions on Euclidean space. It is also a special case of convolution on groups when the group is the group of n-tuples of integers. Similar to the one-dimensional case, an asterisk is used to represent the convolution operation.